Pages that link to "Item:Q5959374"
From MaRDI portal
The following pages link to New heuristics for one-dimensional bin-packing (Q5959374):
Displayed 12 items.
- Average-weight-controlled bin-oriented heuristics for the one-dimensional bin-packing problem (Q531429) (← links)
- Nature inspired genetic algorithms for hard packing problems (Q610991) (← links)
- Variable neighbourhood search: methods and applications (Q970194) (← links)
- Two heuristics for the one-dimensional bin-packing problem (Q1018262) (← links)
- Variable neighbourhood search: Methods and applications (Q1029572) (← links)
- Modified subset sum heuristics for bin packing (Q1044695) (← links)
- Worst-case analysis of the subset sum algorithm for bin packing. (Q1417595) (← links)
- A variable neighbourhood search algorithm for the open vehicle routing problem (Q2378421) (← links)
- An effective hybrid algorithm for the problem of packing circles into a larger containing circle (Q2387245) (← links)
- Solving the one-dimensional bin packing problem with a weight annealing heuristic (Q2468485) (← links)
- Fast lifting procedures for the bin packing problem (Q2581316) (← links)
- Heuristics for determining the number of warehouses for storing non-compatible products (Q3410327) (← links)