Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
9664099 | European Journal of Operational Research | 2005 | 13 Pages |
Abstract
In this paper, we evaluate different known lower bounds for the bin-packing problem including linear programming relaxation (LP), Lagrangean relaxation (LR), Lagrangean decomposition (LD) and the Martello-Toth (MT) [Martello, S., Toth, P., Knapsack Problems: Algorithms and Computer Implementations, Wiley, New York, 1990] lower bounds. We give conditions under which Lagrangean bounds are superior to the LP bound, show that Lagrangean decomposition (LD) yields the same bound as Lagrangean relaxation (LR) and prove that the MT lower bound is a Lagrangean bound evaluated at a finite set of Lagrange multipliers; hence, it is no better than the LR and LD lower bounds.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Samir Elhedhli,