| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4652711 | Electronic Notes in Discrete Mathematics | 2010 | 8 Pages |
Abstract
In this paper, we aim at making appear the way 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 state a Reformulation Theorem which associates some flow model with a given Bin-Packing problem, and we provide an algorithm.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
