Unit cost buyback problem
From MaRDI portal
Publication:2322706
DOI10.1007/S00224-018-9897-7zbMATH Open1422.91389OpenAlexW4235876023MaRDI QIDQ2322706FDOQ2322706
Authors: Yasushi Kawase, Xin Han, Kazuhisa Makino 
Publication date: 5 September 2019
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-018-9897-7
Recommendations
Online algorithms; streaming algorithms (68W27) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Combinatorial aspects of matroids and geometric lattices (05B35)
Cites Work
- Online removable knapsack problem under convex function
- Title not available (Why is that?)
- Optimal Resource Augmentations for Online Knapsack
- Randomized algorithms for online knapsack problems
- Buyback problem -- approximate matroid intersection with cancellation costs
- Title not available (Why is that?)
- Online unweighted knapsack problem with removal cost
- Online minimization knapsack problem
- Buyback problem with discrete concave valuation functions
- Unit cost buyback problem
- Proportional Cost Buyback Problem with Weight Bounds
Cited In (6)
- Buyback problem with discrete concave valuation functions
- Unit cost buyback problem
- Proportional Cost Buyback Problem with Weight Bounds
- Buyback problem with discrete concave valuation functions
- Buyback problem -- approximate matroid intersection with cancellation costs
- Proportional cost buyback problem with weight bounds
This page was built for publication: Unit cost buyback problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2322706)
