Pages that link to "Item:Q3392181"
From MaRDI portal
The following pages link to An Optimization Algorithm for the Ordered Open-End Bin-Packing Problem (Q3392181):
Displaying 9 items.
- Lower and upper bounds for the bin packing problem with fragile objects (Q406499) (← links)
- A branch and price algorithm to solve the integrated production planning and scheduling in bulk ports (Q1751727) (← links)
- A branch-and-price algorithm for the two-dimensional vector packing problem with piecewise linear cost function (Q1753400) (← links)
- A global search framework for practical three-dimensional packing with variable carton orientations (Q1761175) (← links)
- On various open-end bin packing game (Q2149858) (← links)
- A cost-efficient method to optimize package size in emerging markets (Q2629738) (← links)
- Exact solution of network flow models with strong relaxations (Q2689828) (← links)
- Integrated Charge Batching and Casting Width Selection at Baosteel (Q2931698) (← links)
- Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems (Q5139850) (← links)
