About Casting 2D-Bin Packing into Network Flow Theory - Archive ouverte HAL Accéder directement au contenu
Rapport Année : 2010

About Casting 2D-Bin Packing into Network Flow Theory

Résumé

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.
Fichier principal
Vignette du fichier
RR-10-11.pdf (340.01 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00679046 , version 1 (14-03-2012)

Identifiants

  • HAL Id : hal-00679046 , version 1

Citer

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

Partager

Gmail Facebook X LinkedIn More