Resolution branch and bound and an application: The maximum weighted stable set problem

Operations Research

Volumn 55, Issue 5, 2007, Pages 932-948

  Avenali, Alessandro ^a  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

Algorithms: branch and bound; Mathematics: combinatorics; Networks graphs; Programming: integer

Indexed keywords

ALGORITHMS; BRANCH AND BOUND METHOD; COMBINATORIAL MATHEMATICS; COMPUTATIONAL METHODS; INTEGER PROGRAMMING;

BRANCHING RULE; POLYNOMIAL TIME;

PROBLEM SOLVING;

EID: 38549123475     PISSN: 0030364X     EISSN: 15265463     Source Type: Journal    
DOI: 10.1287/opre.1070.0397     Document Type: Article

References (24)

1. Avenali, A. 2001. New algorithms for minimum span frequency assignment and maximum weighted stable set problems. Ph.D. thesis, Department of Computer and Systems Science, University of Rome "La Sapienza," Rome, Italy.
2. Baker, A. B. 1995. Intelligent backtracking on constraint satisfaction problems: Experimental and theoretical results. Ph.D. thesis, University of Oregon, Eugene, OR.
3. Balas, E., C. S. Yu. 1986. Finding maximum clique in an arbitrary graph. SIAM J. Comput. 15 1054-1068.
4. Chvátal, V. 1997. Resolution search. Discrete Appl. Math. 73 81-99.
5. Dixon, H. E., M. L. Ginsberg. 2000. Combining satisfiability techniques from AI and OR. Knowledge Engrg. Rev. 15 31-65.
6. Garey, M. R., D. S. Johnson. 1979. Computers and Intractability: A Guide to the Theory of the NP-Completeness. Freeman, New York.
7. Gaschnig, J. 1978. Experimental case studies of backtrack vs. Waltz-type vs. new algorithms for satisficing assignment problems. Proc. Second Conf Canadian Soc. Computational Stud. Intelligence, Toronto, Ontario, Canada, 268-277.
8. Gaschnig, J. 1979. Performance measurement and analysis of certain search algorithms. Ph.D. thesis, Carnegie Mellon University, Pittsburgh, PA. Available as Technical Report CMU-CS-79-124.
9. Ginsberg, M. L. 1993. Dynamic backtracking. J. Artificial Intelligence Res. 1 25-46.
10. Ginsberg, M. L., D. A. McAllester. 1994. GSAT and dynamic backtracking. Second Workshop on Principles and Practice of Constraint Programming, Orcas Island, WA. Springer Verlag, London, UK, 243-265.
11. Ginsberg, M. L., J. M. Crawford, D. W. Etherington. 1996. Dynamic backtracking. Technical report, Computational Intelligence Research Laboratory, University of Oregon, Eugene, OR.
12. Hooker, J. N. 1998. Constraint satisfaction methods for generating valid cuts. D. L. Woodruff, ed. Advances in Computational and Stochastic Optimization, Logic Programming, and Heuristic Search. Kluwer, Boston, MA, 1-30.
13. Hooker, J. N. 2000. Logic-Based Methods for Optimization. Wiley, New York.
14. Hooker, J. N., G. Ottosson, E. S. Thorsteinsson, H.-J. Kim. 2000. A scheme for unifying optimization and constraint satisfaction methods. Knowledge Engrg. Rev. (special issue on AI/OR) 15(1) 11-30.
15. Lovász, L., M. D. Plummer. 1986. Matching Theory. North-Holland, Amsterdam, The Netherlands.
16. Mannino, C., A. Sassano. 1994. An exact algorithm for the maximum stable set problem. Computational Optim. Appl. 3 243-258.
17. Mannino, C., A. Sassano. 1996. Edge projection and the maximum cardinality stable set problem. DIMACS Ser. Discrete Math, and Theoret. Comput. Sci. 26 249-261.
18. McAllester, D. A. 1993. Partial order backtracking. Technical report, Artificial Intelligence Laboratory, Massachusetts Institute of Technology, Cambridge, MA.
19. Parker, R. G., R. L. Rardin. 1988. Discrete Optimization. Academic Press, London, UK.
20. Robinson, J. A. 1965. A machine-oriented logic based on the resolution principle. J. Assoc. Comput. Machinery 12 23-41.
21. Rossi, F., S. Smriglio. 2001. A branch-and-cut algorithm for the maximum cardinality stable set problem. Oper. Res. Lett. 28(2) 63-74.
22. Sanchis, L. A., A. Jagota. 1993. Some experimental and theoretical results on test case generators for the maximum clique problem. Technical Report 93-69, DIMACS, Rutgers University, Piscataway, NJ.
23. Stallman, R. M., G. J. Sussman. 1977. Forward reasoning and dependency-directed backtracking in a system for computer-aided circuit analysis. Artificial Intelligence 9 135-196.
24. Tsang, E. 1983. Foundations of Constraint Satisfaction. Academic Press, London, UK.