Pages that link to "Item:Q2567854"
From MaRDI portal
The following pages link to Heuristic solution of open bin packing problems (Q2567854):
Displayed 5 items.
- Bin packing and cutting stock problems: mathematical models and exact algorithms (Q323473) (← links)
- A composite algorithm for multiprocessor scheduling (Q544815) (← links)
- A general-purpose hill-climbing method for order independent minimum grouping problems: A case study in graph colouring and bin packing (Q1013410) (← links)
- Lower bounds for a bin packing problem with linear usage cost (Q1755229) (← links)
- Measuring instance difficulty for combinatorial optimization problems (Q1762054) (← links)