An Optimization Algorithm for the Ordered Open-End Bin-Packing Problem
From MaRDI portal
Publication:3392181
DOI10.1287/opre.1070.0415zbMath1167.90624OpenAlexW2095975882MaRDI QIDQ3392181
Alberto Ceselli, Giovanni Righini
Publication date: 13 August 2009
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/53eb257ec0f3014a53cbdfb3c13d7940ae7e5b9e
Related Items (9)
A cost-efficient method to optimize package size in emerging markets ⋮ On various open-end bin packing game ⋮ Integrated Charge Batching and Casting Width Selection at Baosteel ⋮ Lower and upper bounds for the bin packing problem with fragile objects ⋮ Exact solution of network flow models with strong relaxations ⋮ Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems ⋮ A branch and price algorithm to solve the integrated production planning and scheduling in bulk ports ⋮ A branch-and-price algorithm for the two-dimensional vector packing problem with piecewise linear cost function ⋮ A global search framework for practical three-dimensional packing with variable carton orientations
This page was built for publication: An Optimization Algorithm for the Ordered Open-End Bin-Packing Problem