An Optimization Algorithm for the Ordered Open-End Bin-Packing Problem
From MaRDI portal
Publication:3392181
Recommendations
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)