Online unweighted knapsack problem with removal cost
From MaRDI portal
(Redirected from Publication:486978)
Recommendations
Cites work
- scientific article; zbMATH DE number 7051298 (Why is no real title available?)
- scientific article; zbMATH DE number 2086630 (Why is no real title available?)
- scientific article; zbMATH DE number 2107164 (Why is no real title available?)
- Average-Case Analysis of Off-Line and On-Line Knapsack Problems
- Buyback problem -- approximate matroid intersection with cancellation costs
- Online minimization knapsack problem
- Online removable knapsack with limited cuts
- Optimal Resource Augmentations for Online Knapsack
- Stochastic on-line knapsack problems
Cited in
(16)- Unit cost buyback problem
- Improved Online Algorithms for Knapsack and GAP in the Random Order Model
- Buyback problem with discrete concave valuation functions
- Improved online algorithms for knapsack and GAP in the random order model
- Online Submodular Maximization Problem with Vector Packing Constraint.
- Online knapsack with removal and recourse
- Online knapsack problem under concave functions
- Online minimization knapsack problem
- Online Knapsack Problem Under Concave Functions
- Proportional Cost Buyback Problem with Weight Bounds
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems
- Online generalized assignment problem with historical information
- Online knapsack problem with removal cost
- Improved online algorithm for fractional knapsack in the random order model
- Online submodular maximization with preemption
- Proportional cost buyback problem with weight bounds
This page was built for publication: Online unweighted knapsack problem with removal cost
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q486978)
