Title of article
Prospective Network Flow Models and Algorithms for Bin Packing Problems
Author/Authors
Quilliot، نويسنده , , A. and Toussaint، نويسنده , , H.، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2010
Pages
8
From page
49
To page
56
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.
Keywords
2D-Bin Packing , graphs , Network flow theory
Journal title
Electronic Notes in Discrete Mathematics
Serial Year
2010
Journal title
Electronic Notes in Discrete Mathematics
Record number
1455352
Link To Document