✦ LIBER ✦

An asymptotically exact algorithm for the high-multiplicity bin packing problem

✍ Scribed by Carlo Filippi; Alessandro Agnetis

Publisher: Springer-Verlag
Year: 2005
Tongue: English
Weight: 213 KB
Volume: 104
Category: Article
ISSN: 0025-5610
DOI: 10.1007/s10107-004-0567-y

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An asymptotically exact polynomial algor

An asymptotically exact polynomial algorithm for equipartition problems

✍ Bruno Simeone 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 397 KB

An exact algorithm for large multiple kn

An exact algorithm for large multiple knapsack problems

✍ David Pisinger 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 137 KB

The Multiple Knapsack Problem (MKP) is the problem of assigning a subset of n items to m distinct knapsacks, such that the total pro®t sum of the selected items is maximized, without exceeding the capacity of each of the knapsacks. The problem has several applications in naval as well as ®nancial ma

An improved lower bound for the bin pack

An improved lower bound for the bin packing problem

✍ Bintong Chen; Bharatendu Srivastava 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 870 KB

Hybrid next-fit algorithm for the two-di

Hybrid next-fit algorithm for the two-dimensional rectangle bin-packing problem

✍ J. B. G. Frenk; G. Galambos 📂 Article 📅 1987 🏛 Springer Vienna 🌐 English ⚖ 686 KB

A new exact method for the two-dimension

A new exact method for the two-dimensional bin-packing problem with fixed orientation

✍ François Clautiaux; Jacques Carlier; Aziz Moukrim 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 170 KB

An approximate algorithm for a high-mult

An approximate algorithm for a high-multiplicity parallel machine scheduling problem

✍ Carlo Filippi 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 382 KB