Pages that link to "Item:Q2899058"
From MaRDI portal
The following pages link to The multidimensional knapsack problem: structure and algorithms (Q2899058):
Displaying 9 items.
- Approximate and exact merging of knapsack constraints with cover inequalities (Q5151546) (← links)
- Identifying redundancy in multi-dimensional knapsack constraints based on surrogate constraints (Q5175471) (← links)
- The minmax multidimensional knapsack problem with application to a chance‐constrained problem (Q5438265) (← links)
- Statistical mechanics analysis of generalized multi-dimensional knapsack problems (Q5870449) (← links)
- The basic train makeup problem in shunting yards (Q5964852) (← links)
- When to use Integer Programming Software to solve large multi-demand multidimensional knapsack problems: a guide for operations research practitioners (Q6094505) (← links)
- Pseudo-polynomial algorithms for solving the knapsack problem with dependencies between items (Q6106591) (← links)
- On the complexity of separating cutting planes for the knapsack polytope (Q6589743) (← links)
- Optimizing a binary integer program by identifying its optimal core problem -- a new optimization concept applied to the multidimensional knapsack problem (Q6629013) (← links)