13.45-14.15 Stephane Grandcolas and Cedric
Pinto.
A new representation of interval
graphs for higher-dimensional
orthogonal packing
14.15-14.45 Julien Dupuis, Pierre Schaus and Yves
Deville.
Failure detection for the Bin-Packing
Constraint
14.45-3.15 Mohamed Sbihi, Stéphane
Zampelli, nicolas beldiceanu and Mats Carlsson.
Generalized k-Dimensional Distance
Constraints with Application to
Circle Packing
3.15-3.45 Coffee Break
3.45-4.15 François Clautiaux, Antoine
Jouglet and Aziz Moukrim.
A constraint-programming approach for
the guillotine-cutting
problem
4.15-4.45 Garcia Fernando, Delgado Miguel and
Aranda Joaquin.
Pre-ordering input sequences of pieces
for 2D Strip Packing Problem: An
empirical study
Bin Packing and Placement problems are an old but still challenging
topic
that has been tackled with different approaches.
On the one hand, the aim of this workshop is to share recent progress
made on pure problems by using any technique (or the mix) like Mixed
Integer Linear Programming, Local Search, or Constraint Programming.
On the other hand, the aim is to presentchallenging problems
formulated and/or solved by these methods, or challenging extensions
that
have a practical interest and for which pure methods do not directly
work.
Submitted papers can be
* Extended Abstracts of new results or
* Abstract of ongoing works
* Systems presentations (with demos at the
workshop)
* Summaries of already accepted or recently
published results
on any topic concerning bin packing and placement constraints.
Submission style is the standard llncs style. Page limit is 6 pages
(authors can refer to long papers but only short papers will be
reviewed).
Submitting a paper to BPPC'09 engages the authors of the paper that at
least one
of them will present the paper at the workshop if the paper is
accepted.
All workshop participants will have to pay the CP registration fee in
addition to the workshop fee.
