A Tight Lagrangean Relaxation Bound for the Manufacturer's Pallet Loading Problem

14 years 8 days ago

In this study we analyze the performance of a Lagrangean relaxation upper bound for the problem of packing the maximum number of rectangles of sizes

Reinaldo Morabito, Randal Farago

Larger Rectangle ´Ä | Pallet Loading Problem | SIU 2002 | Upper Bound |

claim paper

Added	23 Dec 2010
Updated	23 Dec 2010
Type	Journal
Year	2002
Where	SIU
Authors	Reinaldo Morabito, Randal Farago

Comments (0)