An asymptotical study of combinatorial optimization problems by means of statistical mechanics

Journal of Computational and Applied Mathematics

Volumn 186, Issue 1 SPEC. ISS., 2006, Pages 148-162

  Albrecher, Hansjörg ^a   Burkard, Rainer E ^a   Çela, Eranda ^a  

^a GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

Asymptotic behavior; Combinatorial problem; Probabilistic analysis; Statistical mechanics

Indexed keywords

ANNEALING; FUNCTIONS; HEURISTIC METHODS; OPTIMIZATION; PROBABILITY; STATISTICAL MECHANICS;

ASYMPTOTIC BEHAVIOR; COMBINATORIAL PROBLEM; PROBABILISTIC ANALYSIS;

PROBLEM SOLVING;

EID: 26044457675     PISSN: 03770427     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cam.2005.03.068     Document Type: Conference Paper

References (20)

1. E.H.L. Aarts, J. Korst, Simulated Annealing and Boltzmann Machines, Wiley - Interscience Series in Discrete Mathematics and Optimization, Chichester, 1989.
2. H. Albrecher A note on the asymptotic behaviour of bottleneck problems Oper. Res. Lett. 33 2005 183 186
3. D. Aldous The ζ (2 ) limit in the random assignment problem Random Struct. Algor. 18 2001 381 418
4. E. Bonomi, and J. Lutton The asymptotic behavior of quadratic sum assignment problems: a statistical mechanics approach European J. Oper. Res. 26 1986 295 300
5. R.E. Burkard, and U. Fincke The asymptotic probabilistic behavior of quadratic sum assignment problems Zeitschrift für Oper. Res. 27 1982 73 81
6. R.E. Burkard, and U. Fincke On random quadratic bottleneck assignment problems Math. Programming 23 1982 227 232
7. R.E. Burkard, and U. Fincke Probabilistic asymptotic properties of some combinatorial optimization problems Discrete Appl. Math. 12 1985 21 29
8. R.E. Burkard, and F. Rendl A thermodynamically motivated simulation procedure for combinatorial optimization problems European J. Oper. Res. 17 1984 169 174
9. V. Černy Thermodynamical approach to the traveling salesman problem: an efficient simulation algorithm J. Optim. Theory Appl. 45 1985 41 51
10. D. Coppersmith, and G. Sorkin Constructive bounds and exact expectations for the random assignment problem Random Struct. Algor. 15 1999 113 144
11. W.E. Donath Algorithms and average-value bounds for assignment problems IBM J. Res. Dev. 13 1969 380 386
12. J.B.G. Frenk, M. van Houweninge, and A.H.G. Rinnooy Kan Asymptotic properties of the quadratic assignment problem Math. Oper. Res. 10 1985 100 116
13. R.M. Karp An upper bound on the expected cost of an optimal assignment Discrete algorithms and Complexity 1987 Academic Press Boston 1 4
14. S. Kirkpatrick, C.D. Gelatt, and M.P. Vecchi Optimization by simulated annealing Science 120 1982 671 680
15. M. Mézard, and G. Parisi On the solution of the random link matching problems J. de Physique 48 1987 1451 1459
16. B. Olin, Asymptotic properties of random assignment problems, Ph.D. Thesis, Division of Optimization and Systems Theory, Department of Mathematics, Royal Institute of Technology, Stockholm, 1992.
17. W.T. Rhee A note on asymptotic properties of the quadratic assignment problem Oper. Res. Lett. 7 1988 197 200
18. W.T. Rhee Stochastic analysis of the quadratic assignment problem Math. Oper. Res. 16 1991 223 239
19. W. Rudin Real and Complex Analysis 1987 McGraw-Hill New York
20. W. Szpankowski Combinatorial optimization problems for which almost every algorithm is asymptotically optimal! Optimization 33 1995 359 367