✦ LIBER ✦

A Hybrid Improvement Heuristic for the One-Dimensional Bin Packing Problem

✍ Scribed by Adriana C.F. Alvim; Celso C. Ribeiro; Fred Glover; Dario J. Aloise

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Two heuristics for the one-dimensional b

✍ Alok Singh; Ashok K. Gupta 📂 Article 📅 2006 🏛 Springer 🌐 German ⚖ 349 KB

New heuristics for one-dimensional bin-p

✍ Krzysztof Fleszar; Khalil S. Hindi 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 153 KB

Hybrid next-fit algorithm for the two-di

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

A new heuristic algorithm for a class of

✍ Ya Liu; Chengbin Chu; Kanliang Wang 📂 Article 📅 2011 🏛 Springer 🌐 English ⚖ 276 KB

Constrained order packing: comparison of

✍ Nikolaus Furian, Siegfried Vössner 📂 Article 📅 2011 🏛 Springer-Verlag 🌐 English ⚖ 476 KB

Probabilistic analysis of a heuristics f

✍ Dean P. Foster; Rakesh V. Vohra 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 493 KB