About Casting 2D-Bin Packing into Network Flow Theory

Abstract : In this paper, we aim at making appear the way Flow and Multicommodity Flow Theory may be used in order to deal with combinatorial geometry problems like the 2D-Bin Packing problem. In order to do it, we introduce a notion of no circuit double flow, we state a Reformulation Theorem which ties some multicommodity flow model with a given bin-packing problem, and we provide an algorithm whose purpose is to study the way one may deal with the no circuit constraint which is at the core of our multicommodity flow.
Document type :
Reports
Complete list of metadatas

Cited literature [26 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00679046
Contributor : Bastien Doreau <>
Submitted on : Wednesday, March 14, 2012 - 3:38:22 PM
Last modification on : Monday, January 20, 2020 - 12:12:05 PM
Long-term archiving on: Friday, June 15, 2012 - 2:25:52 AM

File

RR-10-11.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00679046, version 1

Collections

Citation

Alain Quilliot, Hélène Toussaint. About Casting 2D-Bin Packing into Network Flow Theory. 2010. ⟨hal-00679046⟩

Share

Metrics

Record views

200

Files downloads

174