Pages that link to "Item:Q1124710"
From MaRDI portal
The following pages link to An exact algorithm for large multiple knapsack problems (Q1124710):
Displayed 14 items.
- MULKNAP (Q18572) (← links)
- Discrete location problems with push-pull objectives (Q697575) (← links)
- Semi-definite relaxation algorithm of multiple knapsack problem (Q698390) (← links)
- LP based heuristics for the multiple knapsack problem with assignment restrictions (Q863573) (← links)
- Model and algorithms for multi-period sea cargo mix problem (Q872163) (← links)
- Sensitivity of the optimum to perturbations of the profit or weight of an item in the binary Knapsack problem (Q995928) (← links)
- An exact algorithm for the fixed-charge multiple knapsack problem (Q1011207) (← links)
- A successive approximation algorithm for the multiple knapsack problem (Q1029265) (← links)
- Very large-scale neighborhood search for the \(K\)-constraint multiple knapsack problem (Q2491319) (← links)
- Upper bounds and exact algorithms for \(p\)-dispersion problems (Q2496032) (← links)
- An improved typology of cutting and packing problems (Q2643945) (← links)
- Integrating Symmetry, Dominance, and Bound-and-Bound in a Multiple Knapsack Solver (Q5387622) (← links)
- PARTITIONING TREES OF SUPPLY AND DEMAND (Q5462677) (← links)
- A multi-period network design problem for cellular telecommunication systems (Q5945859) (← links)