Pages that link to "Item:Q817185"
From MaRDI portal
The following pages link to The multidimensional 0-1 knapsack problem -- bounds and computational aspects (Q817185):
Displaying 9 items.
- Consistency Cuts for Dantzig-Wolfe Reformulations (Q5058051) (← links)
- A comprehensive empirical demonstration of the impact of choice constraints on solving generalizations of the 0–1 knapsack problem using the integer programming option of CPLEX<sup>®</sup> (Q5059432) (← links)
- An Exact Algorithm for the Quadratic Multiknapsack Problem with an Application to Event Seating (Q5139608) (← links)
- The minmax multidimensional knapsack problem with application to a chance‐constrained problem (Q5438265) (← links)
- Surrogate dual method for multi-dimensional nonlinear knapsack problems (Q5456301) (← links)
- When to use Integer Programming Software to solve large multi-demand multidimensional knapsack problems: a guide for operations research practitioners (Q6094505) (← links)
- Refinement of Lagrangian bounds in optimization problems (Q6122370) (← links)
- A branch-and-price-and-cut algorithm for operating room scheduling under human resource constraints (Q6164341) (← links)
- Features for the 0-1 knapsack problem based on inclusionwise maximal solutions (Q6168585) (← links)