A branch-and-price algorithm for the variable size bin packing problem with minimum filling constraint

ISSN： 0254-5330

Source： Annals of Operations Research, Vol.179, Iss.1, 2010-09, pp. : 221-241

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 branch-and-price algorithm for the multi-activity multi-task shift scheduling problem

By Boyer Vincent Gendron Bernard Rousseau Louis-Martin

Journal of Scheduling, Vol. 17, Iss. 2, 2014-04 ,pp. : 185-197

Springer Publishing Company

Access to resources Recommend Favorite

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 new destructive bounding scheme for the bin packing problem

By Jarboui Bassem

Annals of Operations Research, Vol. 179, Iss. 1, 2010-09 ,pp. : 187-202

Springer Publishing Company

Access to resources Recommend Favorite

Approximation algorithms for a hierarchically structured bin packing problem

By Codenotti B. De Marco G. Leoncini M. Montangero M. Santini M.

Information Processing Letters, Vol. 89, Iss. 5, 2004-03 ,pp. : 215-221

Elsevier

Access to resources Recommend Favorite

A Decision Support System for Crew Planning in Passenger Transportation Using a Flexible Branch-and-Price Algorithm

By Freling Richard

Annals of Operations Research, Vol. 127, Iss. 1-4, 2004-03 ,pp. : 203-222

Springer Publishing Company

Access to resources Recommend Favorite