✦ LIBER ✦

Algorithms for on-line bin-packing problems with cardinality constraints

✍ Scribed by Luitpold Babel; Bo Chen; Hans Kellerer; Vladimir Kotov

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An improved lower bound for on-line bin

✍ André van Vliet 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 477 KB

An on-line algorithm for multidimensiona

✍ János Csirik; André van Vliet 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 453 KB

An on-line algorithm for variable-sized

✍ J. Csirik 📂 Article 📅 1989 🏛 Springer-Verlag 🌐 English ⚖ 462 KB

Lower bounds for 1-, 2- and 3-dimensiona

✍ G. Galambos; A. Vliet 📂 Article 📅 1994 🏛 Springer Vienna 🌐 English ⚖ 664 KB

A branch-and-price algorithm for the var

✍ Andrea Bettinelli; Alberto Ceselli; Giovanni Righini 📂 Article 📅 2008 🏛 Springer US 🌐 English ⚖ 492 KB

Bin packing and multiprocessor schedulin

✍ I. Morihara; T. Ibaraki; T. Hasegawa 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 982 KB