Exact and approximate methods for a one-dimensional minimax bin-packing problem

ISSN： 0254-5330

Source： Annals of Operations Research, Vol.206, Iss.1, 2013-07, pp. : 611-626

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

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

By Gupta J. N. D. Ho J. C.

Production Planning and Control, Vol. 10, Iss. 6, 1999-09 ,pp. : 598-603

Taylor & Francis Ltd

Access to resources Recommend Favorite

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

By Alvim Adriana C.F. Ribeiro Celso C. Glover Fred Aloise Dario J.

Journal of Heuristics, Vol. 10, Iss. 2, 2004-03 ,pp. : 205-229

Springer Publishing Company

Access to resources Recommend Favorite

Exact solution of bin-packing problems using column generation and branch-and-bound

By Valério de Carvalho J.M.

Annals of Operations Research, Vol. 86, Iss. 1, 1999-01 ,pp. : 629-659

Springer Publishing Company

Access to resources Recommend Favorite

Energetic reasoning and bin-packing problem, for bounding a parallel machine scheduling problem

By Tercinet Fabrice Néron Emmanuel Lenté Christophe

4OR: Quarterly journal of the Belgian, French and Italian operations research societies, Vol. 4, Iss. 4, 2006-12 ,pp. : 297-317

Springer Publishing Company

Access to resources Recommend Favorite

An effective heuristic for the two-dimensional irregular bin packing problem

By López-Camacho Eunice

Annals of Operations Research, Vol. 206, Iss. 1, 2013-07 ,pp. : 241-264

Springer Publishing Company

Access to resources Recommend Favorite