Pages that link to "Item:Q486978"
From MaRDI portal
The following pages link to Online unweighted knapsack problem with removal cost (Q486978):
Displaying 11 items.
- Online minimization knapsack problem (Q897874) (← links)
- Buyback problem with discrete concave valuation functions (Q1751249) (← links)
- Improved online algorithms for Knapsack and GAP in the random order model (Q2032350) (← links)
- Improved online algorithm for fractional knapsack in the random order model (Q2085749) (← links)
- Online generalized assignment problem with historical information (Q2108140) (← links)
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems (Q2147011) (← links)
- Online knapsack problem under concave functions (Q2319907) (← links)
- Unit cost buyback problem (Q2322706) (← links)
- Proportional cost buyback problem with weight bounds (Q2424877) (← links)
- Online Submodular Maximization Problem with Vector Packing Constraint. (Q5111710) (← links)
- Improved Online Algorithms for Knapsack and GAP in the Random Order Model (Q5875474) (← links)
