An Optimization Algorithm for the Ordered Open-End Bin-Packing Problem

DOI10.1287/OPRE.1070.0415MaRDI QIDQ3392181zbMATH OpenOpenAlexFDO

Authors 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

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

• The Ordered Open-End Bin-Packing Problem
• More on ordered open end bin packing
• scientific article; zbMATH DE number 1934401
• scientific article; zbMATH DE number 1934389
• A note on an open-end bin packing problem

Cited in

(11)

• A global search framework for practical three-dimensional packing with variable carton orientations
• Lower and upper bounds for the bin packing problem with fragile objects
• A branch and price algorithm to solve the integrated production planning and scheduling in bulk ports
• Integrated charge batching and casting width selection at Baosteel
• A cost-efficient method to optimize package size in emerging markets
• A branch-and-price algorithm for the two-dimensional vector packing problem with piecewise linear cost function
• More on ordered open end bin packing
• Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems
• On various open-end bin packing game
• The Ordered Open-End Bin-Packing Problem
• Exact solution of network flow models with strong relaxations

This page was built for publication: An Optimization Algorithm for the Ordered Open-End Bin-Packing Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3392181)