Constraint Integer Programming: A New Approach to Integrate CP and MIP
From MaRDI portal
Recommendations
Cites work
- A new approach to integrating mixed integer programming and constraint logic programming
- Algorithms for hybrid MILP/CP models for a class of optimization problems
- Branch and Infer: A Unifying Framework for Integer and Finite Domain Constraint Programming
- Branching rules revisited
- Computational Integer Programming and Cutting Planes
- Conflict analysis in mixed integer programming
- Degree-two Inequalities, Clique Facets, and Biperfect Graphs
- Embedding \(\{0, \frac{1}{2}\}\)-cuts in a branch-and-cut framework: a computational study
- Facets of the knapsack polytope
- Forward reasoning and dependency-directed backtracking in a system for computer-aided circuit analysis
- GRASP: a search algorithm for propositional satisfiability
- Heuristics of the branch-cut-and-price-framework SCIP
- scientific article; zbMATH DE number 3156817 (Why is no real title available?)
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- scientific article; zbMATH DE number 1041084 (Why is no real title available?)
- scientific article; zbMATH DE number 1947383 (Why is no real title available?)
- scientific article; zbMATH DE number 7124428 (Why is no real title available?)
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- MIPLIB 2003
- Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework
- Mixed logical-linear programming
- Practical Solution of Large Mixed Integer Programming Problems with Umpire
- Preprocessing and Probing Techniques for Mixed Integer Programming Problems
- Principles of Constraint Programming
- Solving planning and scheduling problems with combined integer and constraint programming
- Strengthening Chvátal-Gomory cuts and Gomory fractional cuts
- The traveling salesman problem. A computational study.
- Theory and Applications of Satisfiability Testing
- Valid Linear Inequalities for Fixed Charge Problems
Cited in
(36)- A new approach to integrating mixed integer programming and constraint logic programming
- Constraint programming and operations research
- A branch and bound algorithm for nonconvex quadratic optimization with ball and linear constraints
- Realizability and inscribability for simplicial polytopes via nonlinear optimization
- Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning
- A hybrid method for modeling and solving supply chain optimization problems with soft and logical constraints
- Learn to relax: integrating \(0-1\) integer linear programming with pseudo-Boolean conflict-driven search
- Partial hyperplane activation for generalized intersection cuts
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- Heuristics for packing semifluids
- \textsc{OptiMathSAT}: a tool for optimization modulo theories
- Wombit: a portfolio bit-vector solver using word-level propagation
- LP and SDP branch-and-cut algorithms for the minimum graph bisection problem: a computational comparison
- Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2
- Optimization modulo theories with linear rational costs
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
- Constraint programming with arbitrarily large integer variables
- GLOMIQO: global mixed-integer quadratic optimizer
- A framework for globally optimizing mixed-integer signomial programs
- scientific article; zbMATH DE number 1163305 (Why is no real title available?)
- scientific article; zbMATH DE number 1947383 (Why is no real title available?)
- SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework
- Mixed-integer programming for cycle detection in nonreversible Markov processes
- Multivariable Branching: A 0-1 Knapsack Problem Case Study
- A combinatorial approach for small and strong formulations of disjunctive constraints
- MiningZinc: a declarative framework for constraint-based mining
- Cost-optimal constrained correlation clustering via weighted partial maximum satisfiability
- Differentiable McCormick relaxations
- Computing maximal copies of polyhedra contained in a polyhedron
- Integrating operations research in constraint programming
- Adaptive solution prediction for combinatorial optimization
- Derivative-free mixed binary necklace optimization for cyclic-symmetry optimal design problems
- Automatic MILP Solver configuration by learning problem similarities
- A computational study of primal heuristics inside an MI(NL)P solver
- Arc-consistency with linear programming reduced costs (applied to stable set in chordal graphs)
- SCIP: solving constraint integer programs
Describes a project that uses
Uses Software
This page was built for publication: Constraint Integer Programming: A New Approach to Integrate CP and MIP
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5387617)
