DeepAI
Log In Sign Up

A space-indexed formulation of packing boxes into a larger box

01/02/2021
by   Sam D. Allen, et al.
0

Current integer programming solvers fail to decide whether 12 unit cubes can be packed into a 1x1x11 box within an hour using the natural relaxation of Chen/Padberg. We present an alternative relaxation of the problem of packing boxes into a larger box, which makes it possible to solve much larger instances.

READ FULL TEXT
02/24/2022

A PTAS for Packing Hypercubes into a Knapsack

We study the d-dimensional hypercube knapsack problem where we are given...
05/18/2021

Online bin packing of squares and cubes

In the d-dimensional online bin packing problem, d-dimensional cubes of ...
05/17/2021

A Simple Search Problem

A simple problem is studied in which there are N boxes and a prize known...
03/15/2022

On Comparable Box Dimension

Two boxes in ℝ^d are comparable if one of them is a subset of a translat...
06/18/2021

Approximation Algorithms for Two-Bar Charts Packing Problem

In the Two-Bar Charts Packing Problem (2-BCPP), it is required to pack t...
04/12/2021

Shapes In A Box – Disassembling 3D objects for efficient packing and fabrication

Modern 3D printing technologies and the upcoming mass-customization para...
02/09/2022

A decision-tree framework to select optimal box-sizes for product shipments

In package-handling facilities, boxes of varying sizes are used to ship ...