BPPC'12 fourth international workshop on Bin Packing and Placement Constraints

Fourth International Workshop on
Bin Packing and Placement Constraints
BPPC'12

May 29th 2012, Nantes, France

associated to the Ninth International Conference on the Integration of Artificial
Intelligence and Operations Research techniques in Constraint Programming CPAIOR 2012

Workshop Organisers :

Nicolas Beldiceanu (EMN, France)
François Fages (INRIA, France)

Additional Program Committee Members:

Mats Carlsson (SICS, Sweden)
François Clautiaux (Univ. Lille, France)
Andrea Lodi (Univ. Bologna, Italy)
Silvano Martello (Univ. Bologna, Italy)
Michael Moffitt (IBM Austin, USA)
Helmut Simonis (4C, Cork, Ireland)

Tentative Program

(10h30-12h30 Net-WMS-2 private meeting)

12h30-14h00 lunch (not on site)
14h00-14h30 Stefan Hougardy. A Scale Invariant Algorithm for Packing Rectangles Perfectly
14h30-15h00 Arnaud Letort. A Scalable Sweep Algorithm for the cumulative and bin-packing constraints
15h00-15h30 Lilia Zaourar and Alix Munier-Kordon. An approximation algorithm for testing memories of an integrated circuit
15h30-16h00 Julia Funke, Stefan Hougardy and Jan Schneider. Wirelength Optimal Rectangle Packings

16h00-16h30 break

16h30-17h00 Ahmed Rhiat and Abder Aggoun. Modeling and Solving a class of combinatorial problems in Supply Chain using the Choco Constraint Programming System
17h00-17h30 János Balogh and József Békési. An Improved Lower Bound for a Semi-on-line Bin Packing Problem
17h30-18h00 closing

Call for papers (txt)

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
     * System 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).

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 workshop.

Important Dates

Submission Deadline: March 31 2012 extended until April 5, 2012

Notification to Authors: April 18, 2012
Camera-ready due: May 7, 2010 on http://www.easychair.org/conferences/?conf=bppc12
Workshop: May 29, 2010

Previous workshops: BPPC'10, BPPC'09, BPPC'08

This workshop is sponsored by

the French ANR project Net-WMS-2 follow-up of the EC project

Last update: May 9th, 2012