Constraint Integer Programming: A New Approach to Integrate CP and MIP
From MaRDI portal
Publication:5387617
DOI10.1007/978-3-540-68155-7_4zbMath1142.68504OpenAlexW2147600044MaRDI QIDQ5387617
Timo Berthold, Thorsten Koch, Tobias Achterberg, 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
Mixed integer programming (90C11) Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items
Constraint programming and operations research, Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO, LP and SDP branch-and-cut algorithms for the minimum graph bisection problem: a computational comparison, GLOMIQO: global mixed-integer quadratic optimizer, Multivariable Branching: A 0-1 Knapsack Problem Case Study, Partial hyperplane activation for generalized intersection cuts, Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2, A branch and bound algorithm for nonconvex quadratic optimization with ball and linear constraints, Optimization Modulo Theories with Linear Rational Costs, Realizability and inscribability for simplicial polytopes via nonlinear optimization, A framework for globally optimizing mixed-integer signomial programs, Adaptive solution prediction for combinatorial optimization, A Combinatorial Approach for Small and Strong Formulations of Disjunctive Constraints, Derivative-free mixed binary necklace optimization for cyclic-symmetry optimal design problems, SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework, Mixed-Integer Programming for Cycle Detection in Nonreversible Markov Processes, MiningZinc: a declarative framework for constraint-based mining, Cost-optimal constrained correlation clustering via weighted partial maximum satisfiability, Integrating operations research in constraint programming, A computational study of primal heuristics inside an MI(NL)P solver, Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning, Differentiable McCormick relaxations, ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations, A hybrid method for modeling and solving supply chain optimization problems with soft and logical constraints, Heuristics for packing semifluids, SCIP: solving constraint integer programs, \textsc{OptiMathSAT}: a tool for optimization modulo theories, Learn to relax: integrating \(0-1\) integer linear programming with pseudo-Boolean conflict-driven search, Wombit: a portfolio bit-vector solver using word-level propagation, Computing Maximal Copies of Polyhedra Contained in a Polyhedron
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
