The minimum raster set problem and its application to the \(d\)-dimensional orthogonal packing problem
From MaRDI portal
Publication:724050
DOI10.1016/j.ejor.2018.04.046zbMath1403.90574OpenAlexW2799771331MaRDI QIDQ724050
Artem V. Ripatti, Vadim M. Kartak
Publication date: 25 July 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2018.04.046
Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Combinatorial aspects of packing and covering (05B40)
Related Items (4)
Single workgroup scheduling problem with variable processing personnel ⋮ Constructing an instance of the cutting stock problem of minimum size which does not possess the integer round-up property ⋮ A cutting plane method and a parallel algorithm for packing rectangles in a circular container ⋮ Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization
Cites Work
- Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems
- A time-indexed LP-based approach for min-sum job-shop problems
- A general framework for bounds for higher-dimensional orthogonal packing problems.
- New lower bounds for bin packing problems with conflicts
- Bidimensional packing by bilinear programming
- Families of non-IRUP instances of the one-dimensional cutting stock problem
- LP bounds in various constraint programming approaches for orthogonal packing
- Conservative scales in packing problems
- Minimal proper non-IRUP instances of the one-dimensional cutting stock problem
- A new constraint programming approach for the orthogonal packing problem
- Exact Solution of the Two-Dimensional Finite Bin Packing Problem
- Combinatorial Benders' Cuts for the Strip Packing Problem
- An Exact Algorithm for the Two-Dimensional Strip-Packing Problem
- New data-dependent dual-feasible functions and lower bounds for a two-dimensional bin-packing problem
- Bounds for Two-Dimensional Cutting
- One-dimensional relaxations and LP bounds for orthogonal packing
- Two-Dimensional Finite Bin-Packing Algorithms
- Recursive Computational Procedure for Two-dimensional Stock Cutting
- A Combinatorial Characterization of Higher-Dimensional Orthogonal Packing
This page was built for publication: The minimum raster set problem and its application to the \(d\)-dimensional orthogonal packing problem
