The following pages link to The min-conflict packing problem (Q1761135):
Displaying 9 items.
- The minimum backlog problem (Q888427) (← links)
- Heuristics and lower bounds for the bin packing problem with conflicts (Q1765544) (← links)
- Bin packing problem with conflicts and item fragmentation (Q2026980) (← links)
- On the benchmark instances for the bin packing problem with conflicts (Q2056901) (← links)
- ParadisEO-MO: from fitness landscape analysis to efficient local search algorithms (Q2359156) (← links)
- The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers (Q2691324) (← links)
- Heuristics for solving the bin-packing problem with conflicts (Q2898516) (← links)
- Probabilistic Tabu search with multiple neighborhoods for the Disjunctively Constrained Knapsack Problem (Q4603929) (← links)
- Lexicographic optimization for the multi-container loading problem with open dimensions for a shoe manufacturer (Q6054017) (← links)