The Ordered Open-End Bin-Packing Problem
From MaRDI portal
Publication:3637387
DOI10.1287/opre.51.5.759.16753zbMath1165.90615OpenAlexW2107065500MaRDI QIDQ3637387
Publication date: 9 July 2009
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/d91ea5e5ba3616fe9d6df773df16a4bbb3343038
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (14)
Online bin packing with overload cost ⋮ Sequential vector packing ⋮ On various open-end bin packing game ⋮ Open-end bin packing: new and old analysis approaches ⋮ A note on a variant of the online open end bin packing problem ⋮ Comparing online algorithms for bin packing problems ⋮ An asymptotic approximation scheme for the concave cost bin packing problem ⋮ Online interval coloring with packing constraints ⋮ A global search framework for practical three-dimensional packing with variable carton orientations ⋮ Integrated production and delivery scheduling with disjoint windows ⋮ Asymptotic fully polynomial approximation schemes for variants of open-end bin packing ⋮ More on ordered open end bin packing ⋮ On lazy bin covering and packing problems ⋮ A lower bound for online rectangle packing
This page was built for publication: The Ordered Open-End Bin-Packing Problem
