Pages that link to "Item:Q2282074"
From MaRDI portal
The following pages link to Exact and approximate algorithms for discounted \(\{0\text{-}1\}\) knapsack problem (Q2282074):
Displaying 12 items.
- Dynamic programming based algorithms for the discounted \(\{0-1\}\) knapsack problem (Q428109) (← links)
- Approximation algorithms for the m-dimensional 0-1 knapsack problem: Worst-case and probabilistic analyses (Q789319) (← links)
- New exact approaches and approximation results for the penalized knapsack problem (Q1634770) (← links)
- Approximating the 3-period incremental knapsack problem (Q1711662) (← links)
- An exact algorithm for the capacitated total quantity discount problem (Q1926936) (← links)
- Heuristic and exact reduction procedures to solve the discounted 0-1 knapsack problem (Q2079394) (← links)
- Knapsack problems -- an overview of recent advances. I: Single knapsack problems (Q2147010) (← links)
- Exact algorithms for the 0-1 time-bomb knapsack problem (Q2147139) (← links)
- On approximating the incremental knapsack problem (Q2422736) (← links)
- Heuristic and Exact Algorithms for the Interval Min–Max Regret Knapsack Problem (Q3466782) (← links)
- Computing and Selecting ε-Efficient Solutions of {0, 1}-Knapsack Problems (Q3556579) (← links)
- Balancing the profit and capacity under uncertainties: a target‐based distributionally robust knapsack problem (Q6091423) (← links)
