New data-dependent dual-feasible functions and lower bounds for a two-dimensional bin-packing problem

ISSN： 0020-7543

Source： International Journal of Production Research, Vol.47, Iss.2, 2009-01, pp. : 537-560

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 dynamic programming-based heuristic for the variable sized two-dimensional bin packing problem

By Liu Ya

International Journal of Production Research, Vol. 49, Iss. 13, 2011-07 ,pp. : 3815-3831

Taylor & Francis Ltd

Access to resources Recommend Favorite

A heuristic for variable size multiobjective two-dimensional bin packing

By Liu Ya Chu Chengbin Wu Feng

International Journal of Production Research, Vol. 52, Iss. 12, 2014-06 ,pp. : 3450-3465

Taylor & Francis Ltd

Access to resources Recommend Favorite

Semi-on-line bin packing: a short overview and a new lower bound

By Balogh János Békési József

Central European Journal of Operations Research, Vol. 21, Iss. 4, 2013-12 ,pp. : 685-698

Springer Publishing Company

Access to resources Recommend Favorite

An efficient intelligent search algorithm for the two‐dimensional rectangular strip packing problem

INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, Vol. 23, Iss. 1-2, 2016-01 ,pp. : 65-92

John Wiley & Sons Inc

Access to resources Recommend Favorite

A mixed integer programming formulation for the three‐dimensional bin packing problem deriving from an air cargo application

INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, Vol. 23, Iss. 1-2, 2016-01 ,pp. : 187-213

John Wiley & Sons Inc

Access to resources Recommend Favorite