Skip to main content
SpringerLink
Log in
Book cover

Encyclopedia of Optimization pp 792–802Cite as

Domination Analysis in Combinatorial Optimization

  • Reference work entry

  • 283 Accesses

Article Outline

Keywords and Phrases

Introduction

Definitions

Methods

  Greedy-Type Algorithms

  Better-Than-Average Heuristics

Cases

  Traveling Salesman Problem

  Upper Bounds for Domination Numbers of ATSP Heuristics

  Multidimensional Assignment Problem (MAP)

  Minimum Partition and Multiprocessor Scheduling Problems

  Max Cut Problem

  Constraint Satisfaction Problems

  Vertex Cover, Independent Set and Clique Problems

  Quadratic Assignment Problem

See also

References

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   2,500.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD   2,499.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Ahuja RK, Ergun Ö, Orlin JB, Punnen AP (2002) A survey of very large-scale neighborhood search techniques. Discret Appl Math 123:75–102

    Google Scholar 

  2. Alon N, Gutin G, Krivelevich M (2004) Algorithms with large domination ratio. J Algorithms 50:118–131

    Article  MATH  MathSciNet  Google Scholar 

  3. Ausiello G, Crescenzi P, Gambosi G, Kann V, Marchetti-Spaccamela A, Protasi M (1999) Complexity and Approximation. Springer, Berlin

    MATH  Google Scholar 

  4. Balas E, Saltzman MJ (1991) An algorithm for the three-index assignment problem. Oper Res 39:150–161

    MATH  MathSciNet  Google Scholar 

  5. Bang-Jensen J, Gutin G (2000) Digraphs: Theory, Algorithms and Applications. Springer, London

    Google Scholar 

  6. Bang-Jensen J, Gutin G, Yeo A (2004) When the greedy algorithm fails. Discret Optim 1:121–127

    Article  MATH  MathSciNet  Google Scholar 

  7. Ben-Arieh D, Gutin G, Penn M, Yeo A, Zverovitch A (2003) Transformations of Generalized ATSP into ATSP: experimental and theoretical study. Oper Res Lett 31:357–365

    Article  MATH  MathSciNet  Google Scholar 

  8. Bendall G, Margot F (2006) Greedy Type Resistance of Combinatorial Problems. Discret Optim 3:288–298

    Article  MATH  MathSciNet  Google Scholar 

  9. Berge C (1958) The Theory of Graphs. Methuen, London

    Google Scholar 

  10. Berend B, Skiena SS, Twitto Y, Combinatorial dominance guarantees for heuristic algorithms. ACM Trans Algorithm (to appear)

    Google Scholar 

  11. Cornuejols G, Fisher ML, Nemhauser GL (1977) Location of bank accounts to optimize float; an analytic study of exact and approximate algorithms. Manag Sci 23:789–810

    MATH  MathSciNet  Google Scholar 

  12. Deineko VG, Woeginger GJ (2000) A study of exponential neighbourhoods for the traveling salesman problem and the quadratic assignment problem. Math Prog Ser A 87:519–542

    Article  MATH  MathSciNet  Google Scholar 

  13. Ghosh D, Goldengorin B, Gutin G, Jäger G (2007) Tolerance‐based greedy algorithms for the traveling salesman problem. Commun DQM 41:521–538

    Google Scholar 

  14. Glover F, Gutin G, Yeo A, Zverovich A (2001) Construction heuristics for the asymmetric TSP. Eur J Oper Res 129:555–568

    Article  MATH  MathSciNet  Google Scholar 

  15. Gutin G, Goldengorin B, Huang J (2006) Worst Case Analysis of Max-Regret, Greedy and Other Heuristics for Multidimensional Assignment and Traveling Salesman Problems. Lect Notes Comput Sci 4368:214–225

    Article  MathSciNet  Google Scholar 

  16. Gutin G, Jensen T, Yeo A (2006) Domination analysis for minimum multiprocessor scheduling. Discret Appl Math 154:2613–2619

    Article  MATH  MathSciNet  Google Scholar 

  17. Gutin G, Koller A, Yeo A (2006) Note on Upper Bounds for TSP Domination Number. Algorithm Oper Res 1:52–54

    MATH  MathSciNet  Google Scholar 

  18. Gutin G, Vainshtein A, Yeo A (2002) When greedy-type algorithms fail. Unpublished manuscript

    Google Scholar 

  19. Gutin G, Vainshtein A, Yeo A (2003) Domination Analysis of Combinatorial Optimization Problems. Discret Appl Math 129:513–520

    Article  MATH  MathSciNet  Google Scholar 

  20. Gutin G, Yeo A (2002) Polynomial approximation algorithms for the TSP and the QAP with a factorial domination number. Discret Appl Math 119:107–116

    Article  MATH  MathSciNet  Google Scholar 

  21. Gutin G, Yeo A (2002) Anti-matroids. Oper Res Lett 30:97–99

    Article  MATH  MathSciNet  Google Scholar 

  22. Gutin G, Yeo A (2005) Domination Analysis of Combinatorial Optimization Algorithms and Problems. In: Golumbic M, Hartman I (eds) Graph Theory, Combinatorics and Algorithms: Interdisciplinary Applications. Springer, New York, pp 152–176

    Google Scholar 

  23. Gutin G, Yeo A, Zverovitch A (2002) Traveling salesman should not be greedy: domination analysis of greedy-type heuristics for the TSP. Discret Appl Math 117:81–86

    Article  MATH  Google Scholar 

  24. Gutin G, Yeo A, Zverovitch A (2002) Exponential Neighborhoods and Domination Analysis for the TSP. In: Gutin G, Punnen AP (eds) The Traveling Salesman Problem and its Variations. Kluwer, Dordrecht, pp 223–256

    Google Scholar 

  25. Johnson DS, Gutin G, McGeoch LA, Yeo A, Zhang X, Zverovitch A (2002) Experimental Analysis of Heuristics for ATSP. In: Gutin G, Punnen AP (eds) The Traveling Salesman Problem and its Variations. Kluwer, Dordrecht, pp 445–487

    Google Scholar 

  26. Johnson DS, McGeoch LA (1997) The traveling salesman problem: A case study in local optimization. In: Aarts EHL, Lenstra JK (eds) Local Search in Combinatorial Optimization. Wiley, Chichester, pp 251–310

    Google Scholar 

  27. Johnson DS, McGeoch LA (2002) Experimental Analysis of Heuristics for STSP. In: Gutin G, Punnen AP (eds) The Traveling Salesman Problem and its Variations. Kluwer, Dordrecht, pp 369–443

    Google Scholar 

  28. Kise H, Ibaraki T, Mine H (1979) Performance analysis of six approximation algorithms for the one-machine maximum lateness scheduling problem with ready times. J Oper Res Soc Japan 22:205–223

    MATH  MathSciNet  Google Scholar 

  29. Punnen AP, Margot F, Kabadi SN (2003) TSP heuristics: domination analysis and complexity. Algorithmica 35:111–127

    Article  MATH  MathSciNet  Google Scholar 

  30. Robertson AJ (2001) A set of greedy randomized adaptive local search procedure implementations for the multidimentional assignment problem. Comput Optim Appl 19:145–164

    Article  MATH  MathSciNet  Google Scholar 

  31. Rublineckii VI (1973) Estimates of the accuracy of procedures in the Traveling Salesman Problem. Numer Math Comput Tech 4:18–23 (in Russian)

    MathSciNet  Google Scholar 

  32. Sarvanov VI (1976) The mean value of the functional of the assignment problem. Vestsi Akad Navuk BSSR, Ser Fiz-Mat Navuk 2:111–114 (in Russian)

    Google Scholar 

  33. Zemel E (1981) Measuring the quality of approximate solutions to zero-one programming problems. Math Oper Res 6:319–332

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Royal Holloway, University of London, Egham, UK

    Gregory Gutin

Authors
  1. Gregory Gutin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Chemical Engineering, Princeton University, Princeton, NJ, 08544-5263, USA

    Christodoulos A. Floudas

  2. Center for Applied Optimization, Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL, 32611-6595, USA

    Panos M. Pardalos

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag

About this entry

Cite this entry

Gutin, G. (2008). Domination Analysis in Combinatorial Optimization . In: Floudas, C., Pardalos, P. (eds) Encyclopedia of Optimization. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-74759-0_136

Download citation

Publish with us

Policies and ethics

Search

Navigation