The minimum raster set problem and its application to the d-dimensional orthogonal packing problem

Vadim M. Kartak and Artem V. Ripatti

European Journal of Operational Research, 2018, vol. 271, issue 1, 33-39

Abstract: We consider the well-known d-dimensional Orthogonal Packing Problem (OPP-d). Using the toolset of conservative scales introduced by Fekete and Schepers we are able to change items’ sizes of the initial instance to obtain an equivalent instance with the same solution. In this paper, we present efficient algorithm for building equivalent instances with certain properties.

Keywords: Packing; Orthogonal packing problem; Conservative scale; Equivalence of instances; Raster model (search for similar items in EconPapers)
Date: 2018
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0377221718303734
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:ejores:v:271:y:2018:i:1:p:33-39

DOI: 10.1016/j.ejor.2018.04.046

Access Statistics for this article

European Journal of Operational Research is currently edited by Roman Slowinski, Jesus Artalejo, Jean-Charles. Billaut, Robert Dyson and Lorenzo Peccati

More articles in European Journal of Operational Research from Elsevier
Bibliographic data for series maintained by Catherine Liu ().