Resolution Branch and Bound and an Application: The Maximum Weighted Stable Set Problem

We propose a new resolution algorithm, called resolution branch and bound (RBB), where a branch-and-bound scheme is empowered by exploiting the information contained in a family of closed subproblems, collected by a full resolution phase. In particular, we use this information to define a new branching rule that seems able to reduce the risk of incurring inappropriate branchings. We apply RBB and the proposed branching rule to the maximum weighted stable set problem, as its features allow us to speed up a time-consuming step in the full resolution phase. To compute upper bounds, we generalize to the weighted case the polynomial time procedure provided by Mannino and Sassano [Mannino, C., A. Sassano. 1994. An exact algorithm for the maximum stable set problem. Computational Optim. Appl.3 243--258] for the unweighted case. Computational results validate the effectiveness of the provided branching rule and the good performance of RBB on many DIMACS benchmarks.

[1]  Laura A. Sanchis,et al.  Some Experimental and Theoretical Results on Test Case Generators for the Maximum Clique Problem , 1996, INFORMS J. Comput..

[2]  Fabrizio Rossi,et al.  A branch-and-cut algorithm for the maximum cardinality stable set problem , 2001, Oper. Res. Lett..

[3]  Edward P. K. Tsang,et al.  Foundations of constraint satisfaction , 1993, Computation in cognitive science.

[4]  David S. Johnson,et al.  Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .

[5]  Matthew L. Ginsberg,et al.  Combining satisfiability techniques from AI and OR , 2000, The Knowledge Engineering Review.

[6]  Matthew L. Ginsberg,et al.  GSAT and dynamic backtracking , 1994, KR 1994.

[7]  John N. Hooker,et al.  Logic-Based Methods for Optimization , 1994, PPCP.

[8]  Vasek Chvátal,et al.  Resolution Search , 1995, Discret. Appl. Math..

[9]  John N. Hooker,et al.  Optimization and , 2000 .

[10]  Ronald L. Rardin,et al.  Discrete optimization , 1988, Computer science and scientific computing.

[11]  Carlo Mannino,et al.  An exact algorithm for the maximum stable set problem , 1994, Comput. Optim. Appl..

[12]  J. Gaschnig.  Performance measurement and analysis of certain search algorithms. , 1979 .

[13]  Carlo Mannino,et al.  Edge projection and the maximum cardinality stable set problem , 1993, Cliques, Coloring, and Satisfiability.

[14]  J. A. Robinson,et al.  A Machine-Oriented Logic Based on the Resolution Principle , 1965, JACM.

[15]  A. B. Baker.  Intelligent backtracking on constraint satisfaction problems: experimental and theoretical results , 1995 .

[16]  Gerald J. Sussman,et al.  Forward Reasoning and Dependency-Directed Backtracking in a System for Computer-Aided Circuit Analysis , 1976, Artif. Intell..

[17]  John N. Hooker,et al.  Constraint satisfaction methods for generating valid cuts , 1997 .

[18]  Egon Balas,et al.  Finding a Maximum Clique in an Arbitrary Graph , 1986, SIAM J. Comput..

[19]  David A. McAllester.  Partial Order Backtracking , 1993 .

[20]  Matthew L. Ginsberg,et al.  Dynamic Backtracking , 1993, J. Artif. Intell. Res..