On the complexity of the {k}‐packing function problem

E-ISSN： 1475-3995|24|1-2|347-354

ISSN： 0969-6016

Source： INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, Vol.24, Iss.1-2, 2017-01, pp. : 347-354

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 two‐stage packing problem procedure

INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, Vol. 24, Iss. 1-2, 2017-01 ,pp. : 43-58

John Wiley & Sons Inc

Access to resources Recommend Favorite

Upper bounds for heuristic approaches to the strip packing problem

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

John Wiley & Sons Inc

Access to resources Recommend Favorite

On the complexity of the labeled domination problem in graphs

INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, Vol. 24, Iss. 1-2, 2017-01 ,pp. : 355-367

John Wiley & Sons Inc

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

Optimisation of a multi-objective two-dimensional strip packing problem based on evolutionary algorithms

By de Armas Jesica Leon Coromoto Miranda Gara Segura Carlos

International Journal of Production Research, Vol. 48, Iss. 7, 2010-01 ,pp. : 2011-2028

Taylor & Francis Ltd

Access to resources Recommend Favorite