Pages that link to "Item:Q1866008"
From MaRDI portal
The following pages link to A scheme for exact separation of extended cover inequalities and application to multidimensional knapsack problems (Q1866008):
Displaying 17 items.
- On the solution of multidimensional convex separable continuous knapsack problem with bounded variables (Q319990) (← links)
- Bin packing and cutting stock problems: mathematical models and exact algorithms (Q323473) (← links)
- Recoverable robust knapsacks: the discrete scenario case (Q691430) (← links)
- The multidimensional 0-1 knapsack problem -- bounds and computational aspects (Q817185) (← links)
- Knapsack polytopes: a survey (Q827125) (← links)
- On separating cover inequalities for the multidimensional knapsack problem (Q858283) (← links)
- Optimization algorithms for the disjunctively constrained knapsack problem (Q1797814) (← links)
- On the exact separation of cover inequalities of maximum-depth (Q2115307) (← links)
- On the complexity of separation from the knapsack polytope (Q2164691) (← links)
- Local and global lifted cover inequalities for the 0-1 multidimensional knapsack problem (Q2462108) (← links)
- Rerouting tunnels for MPLS network resource optimization (Q2469604) (← links)
- An efficient algorithm for the collapsing knapsack problem (Q2489216) (← links)
- Very large-scale neighborhood search for the \(K\)-constraint multiple knapsack problem (Q2491319) (← links)
- Separation algorithms for 0-1 knapsack polytopes (Q2638369) (← links)
- Cover inequalities for robust knapsack sets -- application to the robust bandwidth packing problem (Q2892146) (← links)
- On the complexity of separating cutting planes for the knapsack polytope (Q6589743) (← links)
- Two-set inequalities for the binary knapsack polyhedra (Q6670502) (← links)
