✦ LIBER ✦

A new heuristic algorithm for the one-dimensional bin-packing problem

✍ Scribed by Gupta, Jatinder N. D.; Ho, Johnny C.

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

New heuristics for one-dimensional bin-p

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

Two heuristics for the one-dimensional b

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

An effective heuristic for the two-dimen

✍ Eunice López-Camacho, Gabriela Ochoa, Hugo Terashima-Marín, Edmund K. Burke 📂 Article 📅 2013 🏛 Springer US 🌐 English ⚖ 819 KB

Sequence based heuristics for two-dimens

✍ Alvelos, Filipe; Chan, T. M.; Vilaça, Paulo; Gomes, Tiago; Silva, Elsa; Valério 📂 Article 📅 2009 🏛 Taylor and Francis Group 🌐 English ⚖ 351 KB