One-dimensional relaxations and LP bounds for orthogonal packing

DOI10.1111/J.1475-3995.2009.00713.XzbMath1179.90273OpenAlexW2165756754MaRDI QIDQ3401330

No author found.

Publication date: 29 January 2010

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/j.1475-3995.2009.00713.x

zbMATH Keywords

modelingrelaxationpackingprobingconservative scalesdual-feasible function

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (9)

Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization ⋮ Conservative scales in packing problems ⋮ Relations between capacity utilization, minimal bin size and bin number ⋮ LP bounds in various constraint programming approaches for orthogonal packing ⋮ Multi-dimensional bin packing problems with guillotine constraints ⋮ Exact solution techniques for two-dimensional cutting and packing ⋮ The minimum raster set problem and its application to the \(d\)-dimensional orthogonal packing problem ⋮ Upper bounds for heuristic approaches to the strip packing problem ⋮ The maximum diversity assortment selection problem

Cites Work

• Unnamed Item
• A general framework for bounds for higher-dimensional orthogonal packing problems.
• A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem
• A branch and bound algorithm for the strip packing problem
• Solving binary cutting stock problems by column generation and branch- and-bound
• Packing small boxes into a big box.
• Families of non-IRUP instances of the one-dimensional cutting stock problem
• LP models for bin packing and cutting stock problems
• Branching rules revisited
• A new constraint programming approach for the orthogonal packing problem
• A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces
• A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem
• Exact Solution of the Two-Dimensional Finite Bin Packing Problem
• An Exact Approach to the Strip-Packing Problem
• Setup and Open-Stacks Minimization in One-Dimensional Stock Cutting
• Using Decomposition Techniques and Constraint Programming for Solving the Two-Dimensional Bin-Packing Problem
• Bounds for Two-Dimensional Cutting
• A Linear Programming Approach to the Cutting-Stock Problem
• An Exact Algorithm for Higher-Dimensional Orthogonal Packing
• Two-Dimensional Finite Bin-Packing Algorithms
• One-dimensional heuristics adapted for two-dimensional rectangular strip packing
• A Combinatorial Characterization of Higher-Dimensional Orthogonal Packing
• Analysis of upper bounds for the pallet loading problem

This page was built for publication: One-dimensional relaxations and LP bounds for orthogonal packing