Simulated annealing for the unconstrained quadratic pseudo-Boolean function

European Journal of Operational Research

Volumn 108, Issue 3, 1998, Pages 641-652

  Alkhamis, Talal M ^a   Hasan, Merza ^a   Ahmed, Mohamed A ^a  

^a KUWAIT UNIVERSITY   (Kuwait)

Author keywords

0 1 quadratic programming; Heuristics; Simulated annealing

Indexed keywords

ALGORITHMS; BOOLEAN FUNCTIONS; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; MATHEMATICAL PROGRAMMING; MATRIX ALGEBRA; PROBLEM SOLVING; SIMULATED ANNEALING; VECTORS;

BOUNDING ALGORITHMS; COMPUTATIONAL TIME; QUADRATIC PROGRAMMING;

HEURISTIC METHODS;

EID: 0032143714     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(97)00130-6     Document Type: Article

References (23)

1. E.H.L. Aarts, J. Korst, Simmulated Annealing and Boltzmann Machines, Wiley and Sons, Chichester, 1988.
2. E.H.L. Aarts, J. Korst, P. Van Laarhoven, A quantitative analysis of the simulated annealing algorithm: A case study for the traveling salesman problem, Journal of Statistical Physics 50 (1988) 187-206.
3. W.E. Adams, A. Billionnet, A. Sutter, Unconstrained 0-1 optimization and Lagrangean relaxation, Discrete Applied Mathematics 29 (1990) 131-142.
4. B. Aspvall, M. Plass, R.E. Tarjan, A linear time algorithm for testing the truth of certain quantified formulas, Information Processing Letters 8 (1979) 121-123.
5. F. Barahona, A solvable case of quadratic 0-1 programming, Discrete Applied Mathematics 13 (1986) 23-26.
6. F. Barahona, M. Junger, G. Reinelt, Experiments in quadratic 0-1 programming, Mathematical Programming 44 (1989) 127-137.
7. A. Billionnet, A. Sutter, Minimization of a quadratic pseudo-Boolean function, European Journal of Operational Research 78 (1994) 106-115.
8. E. Boros, Y. Carma, P.L. Hammer, Upper-bounds for quadratic 0-1 maximization, Operations Research Letters 9 (1990) 73-79.
9. E. Boros, Y. Carma, P.L. Hammer, Chvatal cuts and odd cycle inequalities in quadratic 0-1 optimization, SIAM Journal of Discrete Mathematics 5 (2) (1992) 163-177.
10. S.T. Chakradhar, M.L. Bushnell, A solvable class of quadratic 0-1 programming, Discrete Applied Mathematics 36 (1992) 233-251.
11. Y. Crama, P. Hansen, B. Jaumard, The basic algorithm for pseudo-Boolean Programming revisited, Technical report RRR #54-88, Rutgers Center for Operations Research (RUTCOR), Rutgers University, New Brunswick, NJ, 1988.
12. G. Gallo, P.L. Hammer, B. Simeone, Quadratic knapsack problem, Mathematical Programming 12 (1980) 132-149.
13. M.R. Garey, D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco, 1979.
14. P.L. Hammer, Some network flow problems solved with pseudo-Boolean programming, Operations Research 13 (1965) 388-399.
15. P.L. Hammer, P. Hansen, B. Simeone, Roof duality, complementation, and persistency in quadratic 0-1 optimization, Mathematical Programming 28 (2) (1984) 121-155.
16. S. Kirkpatrick, C.D. Gelatt Jr, M.P. Vecchi, Optimization by simulated annealing, Science 220 (1983) 671-680.
17. C. Koulamas, S.R. Antony, R. Jaen, A survey of simulated annealing applications to operations research problems, Omega 22 (1) (1994) 41-56.
18. J. Krarup, P.A. Pruzan, Computer aided layout design, Mathematical Programming Study 9 (1978) 75-94.
19. R.D. McBride, J.S. Yormark, An implicit enumeration algorithm for quadratic integer programming, Management Science 26 (3) (1980) 282-296.
20. N. Metropolis, A.W. Rosenbluth, M.N. Rosenbluth, A.H. Teller, Equation of state calculations by fast computing machines, Journal of Chemical Physics 21 (1953) 1087-1092.
21. P.M. Paradalos, G.P. Rodgers, Computational aspects of a branch and bound algorithm for quadratic zero-one programming, Computing 45 (1990) 131-144.
22. J.C. Picard, H.D. Ratliff, Minimum cuts and related problems, Networks 5 (1974) 357-370.
23. A.C. Williams, Quadratic 0-1 programming using the roof dual with computational results, RUTCOR Research Report #8-85, The State University of New Jersey, 1985.