Pages that link to "Item:Q1044695"
From MaRDI portal
The following pages link to Modified subset sum heuristics for bin packing (Q1044695):
Displaying 10 items.
- Parametric packing of selfish items and the subset sum algorithm (Q261356) (← links)
- Constrained order packing: comparison of heuristic approaches for a new bin packing problem (Q300978) (← links)
- A hybrid algorithm for constrained order packing (Q301159) (← links)
- Average-weight-controlled bin-oriented heuristics for the one-dimensional bin-packing problem (Q531429) (← links)
- Heuristics for the variable sized bin-packing problem (Q1017465) (← links)
- Worst-case analysis of the subset sum algorithm for bin packing. (Q1417595) (← links)
- Minimizing the number of stations and station activation costs for a production line (Q1652155) (← links)
- Efficient algorithms for real-life instances of the variable size bin packing problem (Q1761234) (← links)
- Sum-of-squares heuristics for bin packing and memory allocation (Q3507786) (← links)
- A morph-based simulated annealing heuristic for a modified bin-packing problem (Q4363746) (← links)