Exploiting Packing Components in General-Purpose Integer Programming Solvers

Jakub Mareček ()
Additional contact information
Jakub Mareček: IBM Research – Ireland

Chapter Chapter 10 in Optimized Packings with Applications, 2015, pp 207-223 from Springer

Abstract: Abstract The problem of packing boxes into a large box is often only a part of a complex problem. For example in furniture supply chain applications, one needs to decide what trucks to use to transport furniture between production sites and distribution centres and stores, such that the furniture fits inside. Such problems are often formulated and sometimes solved using general-purpose integer programming solvers. This chapter studies the problem of identifying a compact formulation of the multi-dimensional packing component in a general instance of integer linear programming, reformulating it using the discretisation of Allen–Burke–Mareček, and solving the extended reformulation. Results on instances of up to 10,000,000 boxes are reported.

Keywords: Packing; Multi-dimensional packing; Integer programming; Structure exploitation (search for similar items in EconPapers)
Date: 2015
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

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:spr:spochp:978-3-319-18899-7_10

Ordering information: This item can be ordered from
http://www.springer.com/9783319188997

DOI: 10.1007/978-3-319-18899-7_10

Access Statistics for this chapter

More chapters in Springer Optimization and Its Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().