Bound reduction techniques for Constraint Programming and Mixed-Integer Nonlinear Programming

Important dates

Feb 28: Submission deadline
Mar 20: Submission extension
Call for papers
Apr 15: Notification of acceptance
May 15: Final version of extended abstract due.
Back to Workshop description

Organizing Committee:

Pietro Belotti - Lehigh University, USA
Martine Ceberio - University of Texas at El Paso, USA
Laurent Granvilliers - Université de Nantes, France
Leo Liberti - Ecole Polytechnique, France
Michel Rueher: Université de Nice Sophia Antipolis, France
Nick Sahinidis - Carnegie Mellon University, USA

Main organizer:

Pietro Belotti
Dept. of Industrial & Systems Eng.
Lehigh University
200 W Packer Ave
Bethlehem PA 18015

Workshop of CPAIOR’09
May 28th, 2009
Hosted by: Tepper School of Business, Carnegie Mellon University.

PDF version of the program

1:30 | Introductory talk :

Pietro Belotti, “Bound reduction techniques for global optimization solvers”

2:15pm - 3:45pm | Session I:

Domenico Salvagnin, "Feasibility Pump 2.0";
Mahdi Namazifar, "Linear envelopes of bounded multilinear functions";
George Katsirelos, ‘The limits of Constraint Decompositions”.

4:15pm - 5:45pm | Session II

Kostas Stergiou, "Heuristics for dynamically adapting constraint propagation in CP"
Bob Fourer, "Experimenting with Near-Optimal Formulations for Discrete Optimization Problems"
Serge Kruk, “Some facets of multiple alldifferent predicate”