Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

12

CP
2000
Springer

favoriteEmaildiscussreport

96views Artificial Intelligence» more CP 2000»

Linear Formulation of Constraint Programming Models and Hybrid Solvers

13 years 8 months ago

Linear Formulation of Constraint Programming Models and Hybrid Solvers

Download www.inf.utfsm.cl

Constraint programming oﬀers a variety of modeling objects such as logical and global constraints, that lead to concise and clear models for expressing combinatorial optimization problems. We propose a way to provide a linear formulation of such a model and detail, in particular, the transformation of some global constraints. An automatic procedure for producing and updating formulations has been implemented and we illustrate it on combinatorial optimization problems.

Philippe Refalo

Real-time Traffic

Artificial Intelligence | Combinatorial Optimization Problems | Constraint Programming Oﬀers | CP 2000 | Global Constraints |

claim paper

Related Content

» Hybrid Local Search for Constrained Financial Portfolio Selection Problems

» Tackling the Container Loading Problem A Hybrid Approach Based on Integer Linear Programmi...

» Hybrid cc with Interval Constraints

» Concise Integer Linear Programming Formulations for Dependency Parsing

» Synchronization Verification in SystemLevel Design with ILP Solvers

» Tailoring SolverIndependent Constraint Models A Case Study with Essence and Minion

» RTLDatapath Verification using Integer Linear Programming

» Hybrid Set Domains to Strengthen Constraint Propagation and Reduce Symmetries

» Loop Formulas for Logic Programs with Arbitrary Constraint Atoms

Post Info
More Details (n/a)

Added	02 Aug 2010
Updated	02 Aug 2010
Type	Conference
Year	2000
Where	CP
Authors	Philippe Refalo

Comments (0)