Constraint Integer Programming: A New Approach to Integrate CP and MIP
From MaRDI portal
Publication:5387617
DOI10.1007/978-3-540-68155-7_4zbMath1142.68504MaRDI QIDQ5387617
Timo Berthold, Tobias Achterberg, Thorsten Koch, Kati Wolter
Publication date: 27 May 2008
Published in: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-68155-7_4
90C11: Mixed integer programming
90C27: Combinatorial optimization
68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
Related Items
Integrating operations research in constraint programming, SCIP: solving constraint integer programs
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Forward reasoning and dependency-directed backtracking in a system for computer-aided circuit analysis
- A new approach to integrating mixed integer programming and constraint logic programming
- Strengthening Chvátal-Gomory cuts and Gomory fractional cuts
- Solving planning and scheduling problems with combined integer and constraint programming
- Branching rules revisited
- Mixed logical-linear programming
- MIPLIB 2003
- Conflict analysis in mixed integer programming
- Algorithms for Hybrid MILP/CP Models for a Class of Optimization Problems
- Embedding {0, ½}-Cuts in a Branch-and-Cut Framework: A Computational Study
- Principles of Constraint Programming
- Degree-two Inequalities, Clique Facets, and Biperfect Graphs
- Valid Linear Inequalities for Fixed Charge Problems
- Practical Solution of Large Mixed Integer Programming Problems with Umpire
- Facets of the knapsack polytope
- Preprocessing and Probing Techniques for Mixed Integer Programming Problems
- Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework
- Branch and Infer: A Unifying Framework for Integer and Finite Domain Constraint Programming
- GRASP: a search algorithm for propositional satisfiability
- Computational Integer Programming and Cutting Planes
- Theory and Applications of Satisfiability Testing
- Heuristics of the Branch-Cut-and-Price-Framework SCIP
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
