Online unweighted knapsack problem with removal cost
From MaRDI portal
Publication:486978
DOI10.1007/S00453-013-9822-ZzbMATH Open1314.68410OpenAlexW2066898525MaRDI QIDQ486978FDOQ486978
Authors: 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
Recommendations
Online algorithms; streaming algorithms (68W27) Analysis of algorithms (68W40) Combinatorial optimization (90C27)
Cites Work
- Title not available (Why is that?)
- Stochastic on-line knapsack problems
- Average-Case Analysis of Off-Line and On-Line Knapsack Problems
- Title not available (Why is that?)
- Optimal Resource Augmentations for Online Knapsack
- Online minimization knapsack problem
- Online removable knapsack with limited cuts
- Buyback problem -- approximate matroid intersection with cancellation costs
- Title not available (Why is that?)
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
- Online Submodular Maximization Problem with Vector Packing Constraint.
- Improved online algorithms for knapsack and GAP in the random order model
- 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)