Pages that link to "Item:Q2277359"
From MaRDI portal
The following pages link to A linear-time algorithm for solving continuous maximin knapsack problems (Q2277359):
Displaying 16 items.
- An exact algorithm for the 0-1 linear knapsack problem with a single continuous variable (Q645559) (← links)
- An exact algorithm for the knapsack sharing problem with common items (Q817562) (← links)
- Nature plays with dice - terrorists do not: Allocating resources to counter strategic versus probabilistic risks (Q948665) (← links)
- An algorithm for solving a structured class of linear programming problems (Q1078069) (← links)
- Relaxation-based algorithms for minimax optimization problems with resource allocation applications (Q1332312) (← links)
- Heuristic and reduction algorithms for the knapsack sharing problem (Q1366711) (← links)
- A pegging approach to the precedence-constrained knapsack problem (Q2371351) (← links)
- Sensitivity analysis of the Knapsack sharing problem: perturbation of the weight of an item (Q2384607) (← links)
- New upper bounds and exact methods for the knapsack sharing problem (Q2396494) (← links)
- An exact algorithm for the knapsack sharing problem (Q2485179) (← links)
- On the complexity of the continuous unbounded knapsack problem with uncertain coefficients (Q2488199) (← links)
- (Q3134089) (← links)
- Sensitivity analysis of the knapsack sharing problem: perturbation of the profit of an item (Q3502135) (← links)
- Linear Time Algorithms for Knapsack Problems with Bounded Weights (Q4939603) (← links)
- (Q5399855) (← links)
- Max-max, max-min, min-max and min-min knapsack problems with a parametric constraint (Q6097849) (← links)
