LP Bounds in an Interval-Graph Algorithm for Orthogonal-Packing Feasibility
From MaRDI portal
Publication:5301142
DOI10.1287/opre.1120.1150zbMath1267.90118OpenAlexW1964951253MaRDI QIDQ5301142
Publication date: 2 July 2013
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.1120.1150
Related Items (7)
A best-fit branch-and-bound heuristic for the unconstrained two-dimensional non-guillotine cutting problem ⋮ An improved skyline based heuristic for the 2D strip packing problem and its efficient implementation ⋮ Combinatorial Benders' Cuts for the Strip Packing Problem ⋮ The Meet-in-the-Middle Principle for Cutting and Packing Problems ⋮ The value of integrating loading and routing ⋮ Exact solution techniques for two-dimensional cutting and packing ⋮ A branch-and-price algorithm for the temporal bin packing problem
This page was built for publication: LP Bounds in an Interval-Graph Algorithm for Orthogonal-Packing Feasibility
