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

ISSN： 0254-5330

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

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

Cardinality constrained bin-packing problems

By Kellerer H. Pferschy U.

Annals of Operations Research, Vol. 92, Iss. 1, 1999-01 ,pp. : 335-348

Springer Publishing Company

Access to resources Recommend Favorite

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

By Brusco Michael

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

Springer Publishing Company

Access to resources Recommend Favorite

A Branch-and-Bound Algorithm for Concave Network Flow Problems

By Fontes Dalila Hadjiconstantinou Eleni Christofides Nicos

Journal of Global Optimization, Vol. 34, Iss. 1, 2006-01 ,pp. : 127-155

Springer Publishing Company

Access to resources Recommend Favorite

A Revision of the Trapezoidal Branch-and-Bound Algorithm for Linear Sum-of-Ratios Problems

By Kuno Takahito

Journal of Global Optimization, Vol. 33, Iss. 2, 2005-10 ,pp. : 215-234

Springer Publishing Company

Access to resources Recommend Favorite

A Branch-and-Bound Based Method for Solving Monotone Optimization Problems

By Sun X. Li J.

Journal of Global Optimization, Vol. 35, Iss. 2, 2006-06 ,pp. : 367-385

Springer Publishing Company

Access to resources Recommend Favorite