One-dimensional relaxations and LP bounds for orthogonal packing
From MaRDI portal
(Redirected from Publication:3401330)
Recommendations
- LP bounds in an interval-graph algorithm for orthogonal-packing feasibility
- LP bounds in various constraint programming approaches for orthogonal packing
- A new exact method for the two-dimensional orthogonal packing problem
- Consecutive ones matrices for multi-dimensional orthogonal packing problems
- New inequalities for 1D relaxations of the 2D rectangular strip packing problem
Cites work
- A branch and bound algorithm for the strip packing problem
- A Combinatorial Characterization of Higher-Dimensional Orthogonal Packing
- A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem
- A general framework for bounds for higher-dimensional orthogonal packing problems.
- A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces
- A Linear Programming Approach to the Cutting-Stock Problem
- A new constraint programming approach for the orthogonal packing problem
- A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem
- An Exact Algorithm for Higher-Dimensional Orthogonal Packing
- An exact approach to the strip-packing problem
- Analysis of upper bounds for the pallet loading problem
- Bounds for Two-Dimensional Cutting
- Branching rules revisited
- Exact solution of the two-dimensional finite bin packing problem
- Families of non-IRUP instances of the one-dimensional cutting stock problem
- scientific article; zbMATH DE number 1264414 (Why is no real title available?)
- LP models for bin packing and cutting stock problems
- One-dimensional heuristics adapted for two-dimensional rectangular strip packing
- Packing small boxes into a big box.
- Setup and open-stacks minimization in one-dimensional stock cutting
- Solving binary cutting stock problems by column generation and branch- and-bound
- Two-Dimensional Finite Bin-Packing Algorithms
- Using decomposition techniques and constraint programming for solving the two-dimensional bin-packing problem
Cited in
(13)- LP bounds in various constraint programming approaches for orthogonal packing
- Conservative scales in packing problems
- Exact solution techniques for two-dimensional cutting and packing
- The maximum diversity assortment selection problem
- Upper bounds for heuristic approaches to the strip packing problem
- New inequalities for 1D relaxations of the 2D rectangular strip packing problem
- Relations between capacity utilization, minimal bin size and bin number
- LP bounds in an interval-graph algorithm for orthogonal-packing feasibility
- Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization
- Solving the parallel processor scheduling and bin packing problems with contiguity constraints: mathematical models and computational studies
- A new branch-and-cut approach for integrated planning in additive manufacturing
- The minimum raster set problem and its application to the \(d\)-dimensional orthogonal packing problem
- Multi-dimensional bin packing problems with guillotine constraints
This page was built for publication: One-dimensional relaxations and LP bounds for orthogonal packing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3401330)
