Nicolas Beldiceanu,
Mats Carlsson, and Sven Thiel
Sweep Synchronization as a Global Propagation
Mechanism
Alexander Bockmayr
Nicolai Pisaruk
Detecting Infeasibility and Generating Cuts for MIP
using CP
Alain Chabrier
Heuristic Branch-and-Price-and-Cut to Solve a
Network Design Problem
Emilie Danna, Edward Rothberg and Claude Le Pape
Simon de Givry and Laurent Jeannin
A Library for Partial and Hybrid Search Methods
Ghada El Khayat, André
Langevin and Diane Riopel,
François Fages and Akash
Lal
A
Global Constraint for Cutset Problems
Stefan Bertels and Torsten Fahle
A
Hybrid Setup for a Hybrid Scenario: Combining Heuristics for the Home Health
Care Problem
Mattias Grönkvist
Using Constraint Propagation to Accelerate Column
Generation in Aircraft Scheduling
F. Le Huédé, M. Grabisch, C. Labreuche and P. Savéant,
Multicriteria Search in Constraint Programming
G. Huang and Andew Lim
A New Approach to Solve the 2-Machines Bicriteria
Flowshop Sceduling Problem
Andrew Lim, Brian
Rodrigues and Fei Xiao,
A New Heuristic for the Bandwith Minimization
Problem
Andrea Lodi, Michela
Miclan
Discrepancy-based Additive Bounding
Samir Loudni and Philippe David
On-Line Resources Allocation for ATM Networks with
Rerouting
Christos
T. Maravelias, Ignacio E. Grossmann
A Hybrid MILP/CP Decomposition Approach for
the Scheduling of Batch Plants
Claude Michel, Yahia Lebbah and Michel Rueher
Safe Embedding of the Simplex Algorithm in a CSP Framework
Chris Jefferson, Angela
Miguel, Ian Miguel and Armagan Tarim
Modelling and Solving English Peg Solitaire
Laurent Perron
Fast Restart Policies and Large Neighborhood Search
Jean-Charles Régin
Solving the Maximum Clique Problem with Constraint
Programming
Andrea Roli
Problem Structure and Search: Empirical Results and
Open Questions
Bertrand Neveu and
Gilles Trombettoni
When Local Search Goes with the Winners
W.J. van Hoeve
A Hybrid Constraint Programming and Semidefinite
Programming Approach for the Stable Set
Problem