论文信息 - Branch and Bound Algorithms for Highly Constrained Integer Programs

Branch and Bound Algorithms for Highly Constrained Integer Programs

In this paper we describe a new branch and bound algorithm for solving 0-1 integer linear programs (ILP). The algorithm is specifically targeted at ILP instances that are highly constrained, i.e. instances for which the constraints are hard to satisfy. Our approach is based on recent algorithms for solving instances of Propositional Satisfiability (SAT) which are also highly constrained. In particular we illustrate how the branch and bound algorithm for solving ILPs can be improved with search pruning techniques commonly used in SAT algorithms. The usefulness of the proposed branch and bound algorithm is illustrated on a practical application for which instances are in general highly constrained. Branch and Bound Algorithms for Highly Constrained Integer Programs 1

Vasco M. Manquinho | Arlindo L. Oliveira | K. Sakallah | R. A. Redol | João Silva

[1] Hilary Putnam,et al. A Computing Procedure for Quantification Theory , 1960, JACM.

[2] David A. McAllester,et al. A Rearrangement Search Strategy for Determining Propositional Satisfiability , 1988, AAAI.

[3] Ravindra K. Ahuja,et al. Network Flows: Theory, Algorithms, and Applications , 1993 .

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

[5] P. Barth. A Davis-Putnam based enumeration algorithm for linear pseudo-Boolean optimization , 1995 .

[6] Olivier Coudert,et al. On solving covering problems , 1996, DAC '96.

[7] Joao Marques-Silva,et al. GRASP-A new search algorithm for satisfiability , 1996, Proceedings of International Conference on Computer Aided Design.

[8] Clara Pizzuti. Computing prime implicants by integer programming , 1996, Proceedings Eighth IEEE International Conference on Tools with Artificial Intelligence.

[9] Roberto J. Bayardo,et al. Using CSP Look-Back Techniques to Solve Real-World SAT Instances , 1997, AAAI/IAAI.