The following pages link to (Q3624058):
Displayed 12 items.
- Exploiting subproblem dominance in constraint programming (Q453591) (← links)
- A branch-and-bound algorithm for hard multiple knapsack problems (Q545544) (← links)
- Lower bounds and algorithms for the minimum cardinality bin covering problem (Q1752204) (← links)
- Lower bounds for a bin packing problem with linear usage cost (Q1755229) (← links)
- Mathematical models and decomposition methods for the multiple knapsack problem (Q1755383) (← links)
- A constraint programming approach for a batch processing problem with non-identical job sizes (Q1926887) (← links)
- Packing-based branch-and-bound for discrete malleable task scheduling (Q2093190) (← links)
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems (Q2147011) (← links)
- Exhaustive approaches to 2D rectangular perfect packings (Q2390210) (← links)
- A new upper bound for the multiple knapsack problem (Q2668625) (← links)
- A Branch-and-Price Algorithm for the Multiple Knapsack Problem (Q5060791) (← links)
- Integrating Symmetry, Dominance, and Bound-and-Bound in a Multiple Knapsack Solver (Q5387622) (← links)