Pages that link to "Item:Q1812082"
From MaRDI portal
The following pages link to An efficient algorithm for the knapsack sharing problem (Q1812082):
Displayed 6 items.
- A modified descent method-based heuristic for binary quadratic knapsack problems with conflict graphs (Q829173) (← links)
- A cooperative local search-based algorithm for the multiple-scenario max-min knapsack problem (Q1039776) (← 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)
- An exact algorithm for large knapsack sharing problems (Q5883603) (← links)