Linear Formulation of Constraint Programming Models and Hybrid Solvers
- 1 January 2000
- book chapter
- Published by Springer Nature
- p. 369-383
- https://doi.org/10.1007/3-540-45349-0_27
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- A scheme for unifying optimization and constraint satisfaction methodsThe Knowledge Engineering Review, 2000
- Solving TSP through the Integration of OR and CP TechniquesElectronic Notes in Discrete Mathematics, 1999
- Tight Cooperation and Its Application in Piecewise Linear OptimizationPublished by Springer Nature ,1999
- Cost-Based Domain FilteringPublished by Springer Nature ,1999
- Branch and Infer: A Unifying Framework for Integer and Finite Domain Constraint ProgrammingINFORMS Journal on Computing, 1998
- A Generic Model and Hybrid Algorithm for Hoist Scheduling ProblemsPublished by Springer Nature ,1998
- Introducing global constraints in CHIPMathematical and Computer Modelling, 1994
- Tools for reformulating logical forms into zero-one mixed integer programsEuropean Journal of Operational Research, 1994
- Constraint satisfaction using constraint logic programmingArtificial Intelligence, 1992
- Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization ProblemsSIAM Journal on Algebraic Discrete Methods, 1985