Pages that link to "Item:Q1892657"
From MaRDI portal
The following pages link to An exact algorithm for the dual bin packing problem (Q1892657):
Displayed 7 items.
- Models and complexity of multibin packing problems (Q864931) (← links)
- Properties of some ILP formulations of a class of partitioning problems (Q1270767) (← links)
- BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem (Q1362971) (← links)
- Upper bounds and algorithms for the maximum cardinality bin packing problem. (Q1399594) (← links)
- Timing analysis of the flexRay communication protocol (Q2481269) (← links)
- Branch-and-price algorithms for the dual bin packing and maximum cardinality bin packing problem (Q2572248) (← links)
- The skiving stock problem as a counterpart of the cutting stock problem (Q4814101) (← links)