First Workshop on Bin Packing and Placement Constraints BPPC'08

associated to CPAIOR 2008

May 22, 2008, Paris, France

Program Committee :

Nicolas Beldiceanu (EMN, France)
Mats Carlsson (SICS, Sweden)
François Clautiaux (Univ. Lille, France)
François Fages (INRIA, France)
Richard Korf (UCLA, USA)
Andrea Lodi (Univ. Bologna, Italy)
Silvano Martello (Univ. Bologna, Italy)
Michael Moffitt (IBM Austin, USA)

Call for papers


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 present challenging 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).

Program Schedule and Papers

Important Dates

Submission Deadline:         March 15, March 26, 2008
Notification to Authors:      April 15, April 12, 2008
Early registration deadline:  April 18, 2008, on
Camera-ready due:            April 30, 2008, upload pdf revised version on
Last registration deadline:   May 10, 2008. (there will be no on-site registration)
Workshop:                        May 22, 2008.

Registration, Travel, Accomodation and Venue

See the CPAIOR'08 web page.

This workshop is sponsored by the European project

Last update: May 13th 2008