Online unweighted knapsack problem with removal cost
From MaRDI portal
Publication:486978
DOI10.1007/s00453-013-9822-zzbMath1314.68410OpenAlexW2066898525MaRDI QIDQ486978
Xin Han, Yasushi Kawase, Kazuhisa Makino
Publication date: 19 January 2015
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-013-9822-z
Analysis of algorithms (68W40) Combinatorial optimization (90C27) Online algorithms; streaming algorithms (68W27)
Related Items (15)
Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems ⋮ Online minimization knapsack problem ⋮ Proportional cost buyback problem with weight bounds ⋮ Online knapsack with removal and recourse ⋮ Online Knapsack Problem Under Concave Functions ⋮ Improved Online Algorithms for Knapsack and GAP in the Random Order Model ⋮ Buyback problem with discrete concave valuation functions ⋮ Proportional Cost Buyback Problem with Weight Bounds ⋮ Improved online algorithms for Knapsack and GAP in the random order model ⋮ Online Submodular Maximization with Preemption ⋮ Online knapsack problem under concave functions ⋮ Unit cost buyback problem ⋮ Online Submodular Maximization Problem with Vector Packing Constraint. ⋮ Improved online algorithm for fractional knapsack in the random order model ⋮ Online generalized assignment problem with historical information
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Online removable knapsack with limited cuts
- Stochastic on-line knapsack problems
- Buyback Problem - Approximate Matroid Intersection with Cancellation Costs
- Online Minimization Knapsack Problem
- Optimal Resource Augmentations for Online Knapsack
- Average-Case Analysis of Off-Line and On-Line Knapsack Problems
This page was built for publication: Online unweighted knapsack problem with removal cost
