Pages that link to "Item:Q810377"
From MaRDI portal
The following pages link to Solving knapsack sharing problems with general tradeoff functions (Q810377):
Displayed 10 items.
- A cooperative local search-based algorithm for the multiple-scenario max-min knapsack problem (Q1039776) (← links)
- A nonlinear minimax allocation problem with multiple knapsack constraints (Q1178726) (← links)
- A lexicographic minimax algorithm for multiperiod resource allocation (Q1196169) (← links)
- Minimax resource allocation problems: Optimization and parametric analysis (Q1198300) (← links)
- Relaxation-based algorithms for minimax optimization problems with resource allocation applications (Q1332312) (← links)
- Bounded knapsack sharing (Q1804651) (← 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)
- Sensitivity analysis of the knapsack sharing problem: perturbation of the profit of an item (Q3502135) (← links)