On integrating constraint propagation and linear programming for combinatorial optimization

Authors:
John N. Hooker;Greger Ottosson;Erlendur S. Thorsteinsson;Hak-Jin Kim
Affiliations:
-;-;-;-
Venue:
AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
Year:
1999

Citing 5
Cited 13

Mixed logical-linear programming

Discrete Applied Mathematics - Special issue on the satisfiability problem and Boolean functions
Logic-Based Methods for Optimization

PPCP '94 Proceedings of the Second International Workshop on Principles and Practice of Constraint Programming
The Progressive Party Problem: Integer Linear Programming and Constraint Programming Compared

CP '95 Proceedings of the First International Conference on Principles and Practice of Constraint Programming
Branch and Infer: a Unifying Framework for Integer and Finite Domain Constraint Programming

INFORMS Journal on Computing
Properties of Some Combinatorial Optimization Problemsand Their Effect on the Performance of Integer Programming and Constraint Logic Programming

INFORMS Journal on Computing

Mixed Global Constraints and Inference in Hybrid CLP–IP Solvers

Annals of Mathematics and Artificial Intelligence
Mathematical Programming Techniques in Constraint Programming: A Short Overview

Journal of Heuristics
Branch-and-Check: A Hybrid Framework Integrating Mixed Integer Programming and Constraint Logic Programming

CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Combining linear programming and satisfiability solving for resource planning

The Knowledge Engineering Review
A scheme for unifying optimization and constraint satisfaction methods

The Knowledge Engineering Review
Detecting infeasibility and generating cuts for mixed integer programming using constraint programming

Computers and Operations Research
Cost-Based Domain Filtering for Stochastic Constraint Programming

CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
The LPSAT engine & its application to resource planning

IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
The exponentiated subgradient algorithm for heuristic Boolean programming

IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Redundant modeling in permutation weighted constraint satisfaction problems

Constraints
A SAT-based decision procedure for mixed logical/integer linear problems

CPAIOR'05 Proceedings of the Second international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
From propositional satisfiability to satisfiability modulo theories

SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
A branch-and-cut approach to the crossing number problem

Discrete Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

Linear programming and constraint propagation are complementary techniques with the potential for integration to benefit the solution of combinatorial optimization problems. Attempts to combine them have mainly focused on incorporating either technique into the framework of the other -- traditional models have been left intact. We argue that a rethinking of our modeling traditions is necessary to achieve the greatest benefit of such an integration. We propose a declarative modeling framework in which the structure of the constraints indicates how LP and CP can interact to solve the problem.