Linear formulation of constraint programming models and hybrid solvers
From MaRDI portal
Recommendations
- Integrating operations research in constraint programming
- Integrating operations research in constraint programming
- Enhancing the performance of constraint programming through the introduction of linear programming
- Linear relaxations and reduced-Cost based propagation of continuous variable subscripts
- Mixed global constraints and inference in hybrid CLP-IP solvers
Cited in
(24)- Linear programs for constraint satisfaction problems
- Constraint programming and operations research
- Automatically improving constraint models in Savile Row
- A microkernel architecture for constraint programming
- Constraint programming and hybrid formulations for three life designs
- A first look at picking dual variables for maximizing reduced cost fixing
- Cable tree wiring -- benchmarking solvers on a real-world scheduling problem with a variety of precedence constraints
- Nutmeg: a MIP and CP hybrid solver using branch-and-check
- A structure-conveying modelling language for mathematical and stochastic programming
- Submodularity and its application to some global constraints
- A polyhedral approach to the \textit{alldifferent} system
- Detecting infeasibility and generating cuts for mixed integer programming using constraint programming
- Combining linear programming and satisfiability solving for resource planning
- Semidefinite programming and constraint programming
- Modeling with metaconstraints and semantic typing of variables
- Mixed integer linear programming models for combinatorial optimization problems
- Temporal linear relaxation in IBM ILOG CP optimizer
- Modelling cyclicity and generalized cost-based abduction using linear constraint satisfaction
- Enhancing the performance of constraint programming through the introduction of linear programming
- scientific article; zbMATH DE number 1866915 (Why is no real title available?)
- Integrating operations research in constraint programming
- Integrating operations research in constraint programming
- Arc-consistency with linear programming reduced costs (applied to stable set in chordal graphs)
- Reformulation of global constraints based on constraints checkers
This page was built for publication: Linear formulation of constraint programming models and hybrid solvers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4473038)
