Constraint satisfaction methods for generating valid cuts
Advances in computational and stochastic optimization, logic programming, and heuristic search
Generalizing partial order and dynamic backtracking
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
GRASP: A Search Algorithm for Propositional Satisfiability
IEEE Transactions on Computers
Mixed logical-linear programming
Discrete Applied Mathematics - Special issue on the satisfiability problem and Boolean functions
Chaff: engineering an efficient SAT solver
Proceedings of the 38th annual Design Automation Conference
Convexification and Global Optimization in Continuous And
Convexification and Global Optimization in Continuous And
Logic-Based Methods for Optimization
PPCP '94 Proceedings of the Second International Workshop on Principles and Practice of Constraint Programming
PPCP '94 Proceedings of the Second International Workshop on Principles and Practice of Constraint Programming
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Hybrid Benders Decomposition Algorithms in Constraint Logic Programming
CP '01 Proceedings of the 7th 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
Algorithms for Hybrid MILP/CP Models for a Class of Optimization Problems
INFORMS Journal on Computing
A scheme for unifying optimization and constraint satisfaction methods
The Knowledge Engineering Review
Journal of Artificial Intelligence Research
Disco - Novo - GoGo: integrating local search and complete search with restarts
AAAI'06 proceedings of the 21st national conference on Artificial intelligence - Volume 2
An Integrated Solver for Optimization Problems
Operations Research
The accuracy of search heuristics: an empirical study on knapsack problems
CPAIOR'08 Proceedings of the 5th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems
Constraint Based Planning with Composable Substate Graphs
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
The constraint of difference and total dual integrality
Proceedings of the 17th Panhellenic Conference on Informatics
Hi-index | 0.00 |
We present an algorithmic framework for integrating solution methods that is based on search, inference, and relaxation and their interactions. We show that the following are special cases: branch and cut, CP domain splitting with propagation, popular global optimization methods, DPL methods for SAT with conflict clauses, Benders decomposition and other nogood-based methods, partial-order dynamic backtracking, various local search metaheuristics, and GRASPs (greedy randomized adaptive search procedures). The framework allows elements of different solution methods to be combined at will, resulting in a variety of integrated methods. These include continuous relaxations for global constraints, the linking of integer and constraint programming via Benders decomposition, constraint propagation in global optimization, relaxation bounds in local search and GRASPs, and many others.