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
Submitted papers can be
* Extended Abstracts of new results or
* Abstract of ongoing works
* System presentations (with demos at the
* Summaries of already accepted or recently
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
By submitting a paper to BPPC'12, the authors commit that, if the paper
is accepted, at least one author willl present the paper at the