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

This workshop is meant for people in both CP and MINLP to exchange ideas on current trends and developments in bound reduction (also known as domain reduction) techniques and their implementation in exact and heuristic solvers.

Motivation:Bound reduction algorithms are crucial for both Constraint Programming (CP) and Mixed-Integer Nonlinear Programming (MINLP) solvers, as they provide an efficient tool for eliminating suboptimal or infeasible solutions. While some MINLP solvers employ interval analysis techniques with the purpose of tightening the lower bound obtained by relaxations of the problem, the more discrete flavors of CP techniques allow to fix variables and/or exclude sets of solutions from a more symbolic perspective.

The renewed interest in MINLP problems within the Optimization community, and the related development of new exact solvers (see e.g. the COIN-OR solvers Bonmin and Couenne, and also Filmint and the upcoming Minotaur solver) provides a good opportunity to exchange ideas on new bound reduction techniques and on the efficient implementation of well-known methods.

Format: the workshop will consist of 10-12 presentations; each will be half an hour long (25 minutes + discussion) and will be based on an extended abstract that will be submitted by the authors.

Registration: Participants of this workshop are required to register to the CPAIOR conference (see https://wpweb2.tepper.cmu.edu/rlang/CPAIOR09/index.html for details and deadlines). However, there is no additional registration fee for attending this workshop.