Using the unconstrained quadratic program to model and solve Max 2-SAT problems

International Journal of Operational Research

Volumn 1, Issue 1-2, 2005, Pages 89-100

  Kochenberger, Gary ^a   Glover, Fred ^b   Alidaee, Bahram ^c   Lewis, Karen ^c  

^a UNIVERSITY OF COLORADO   (United States)

^b UNIVERSITY OF COLORADO   (United States)

^c UNIVERSITY OF MISSISSIPPI   (United States)

Author keywords

metaheuristics; satisfiability; Tabu search

Indexed keywords

EID: 33947102707     PISSN: 17457645     EISSN: 17457653     Source Type: Journal    
DOI: 10.1504/ijor.2005.007435     Document Type: Article

References (15)

1. Borchers, B. and Furman, J. (1999) ‘A two-phase exact algorithm for Max-SAT and weighted Max SAT’, J. of Combinatorial Optimization, Vol. 2, pp.299–306.
2. Boros, E. and Hammer, P. (2002) ‘Pseudo-boolean optimization’, Discrete Applied Mathematics, Vol. 123, Nos. 1–3, pp.155–225.
3. Du, D., Gu, J. and Pardalos, P. (1997) Satisfiability Problem: Theory and Application, DIMACS Series in Discrete Mathematics, American Mathematical Society, Vol. 35.
4. Glover, F., Kochenberger, G. and Alidaee, B. (1998) ‘Adaptive memory Tabu search for binary quadratic programs’, Management Science, Vol. 44, No. 3, pp.336–345.
5. Glover, F., Kochenberger, G., Alidaee, B. and Amini, M.M. (1999) ‘Tabu search critical event memory: an enhanced application for binary quadratic programs’, in Voss, S., Martello, S., Osman, I. and Roucairol. C. (Eds.): Meta Heuristics: Advances and Trends in Local Search Paradigms for Optimization, Kluwer Academic Publisher, Boston.
6. Hammer, P. and Rudeanu, S. (1968) Boolean Methods in Operations Research, Springer-Verlag, New York.
7. Hansen, P. and Jaumard, B. (1990) ‘Algorithms for the maximum satisfiability problem’, Computing, Vol. 44, pp.279–303.
8. Hansen, P., Jaumard, B. and Mathon, V. (1993) ‘Constrained nonlinear 0–1 programming’, INFORMS Journal on Computing, Vol. 5, No. 2, pp.97–119.
9. Hansen, P.B. (1979) ‘Methods of nonlinear 0–1 programming’, Annals Discrete Math, Vol. 5, pp.53–70.
10. Kochenberger, G., Glover, F., Alidaee, B. and Rego, C. (2005) ‘An unconstrained binary programming approach to the vertex coloring problem’, Annals of Operations Research. (forthcoming).
11. Kochenberger, G.A., Glover, F., Alidaee, B. and Rego, C. (2004) ‘A unified modeling and solution framework for combinatorial optimization problems’, OR Spectrum, Vol. 26, pp.237–250.
12. Lardeux, F., Saubion, S. and Hao, J.K. (2004) ‘Designing efficient recombinating operators for SAT problems’, Lecture Notes in Computer Science, Springer, Vol. 2936, pp.103–114.
13. Lewis, M., Alidaee, B. and Kochenberger, G. (2004) ‘Using xQx to model and solve the uncapacitated task allocation problem’, Operations Research Letters, on-line at Science Direct.
14. Smyth, K., Hoos, H. and Stutzle, T. (2003) ‘Iterated robust Tabu search for Max-Sat’, Proc. of the 16th Canadian Conference on AI, Springer-Verlag, pp.129–144.
15. Yagiura, M. and Ibaraki, T. (2001) ‘Efficient 2 and 3 flip neighborhood search algorithms for the Max SAT: experimental evaluation’, J. of Heuristics, Vol. 7, pp.423–442.