✦ LIBER ✦

Two heuristics for the one-dimensional bin-packing problem

✍ Scribed by Alok Singh; Ashok K. Gupta

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

New heuristics for one-dimensional bin-p

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

A Hybrid Improvement Heuristic for the O

✍ Adriana C.F. Alvim; Celso C. Ribeiro; Fred Glover; Dario J. Aloise 📂 Article 📅 2004 🏛 Springer US 🌐 English ⚖ 317 KB

A new heuristic algorithm for a class of

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

Approximation algorithms for the oriente

✍ Andrea Lodi; Silvano Martello; Daniele Vigo 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 135 KB

Probabilistic analysis of a heuristics f

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

Hybrid next-fit algorithm for the two-di

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