Proportional Cost Buyback Problem with Weight Bounds

DOI10.1007/978-3-319-26626-8_59zbMath1473.68218OpenAlexW2294105859MaRDI QIDQ5743550

Xin Han, Kazuhisa Makino, Yasushi Kawase

Publication date: 5 February 2016

Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-26626-8_59

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Combinatorial aspects of matroids and geometric lattices (05B35) Online algorithms; streaming algorithms (68W27)

Related Items (4)

Proportional cost buyback problem with weight bounds ⋮ Online Knapsack Problem Under Concave Functions ⋮ Online knapsack problem under concave functions ⋮ Unit cost buyback problem

Cites Work

• Online unweighted knapsack problem with removal cost
• Online removable knapsack problem under convex function
• Unit Cost Buyback Problem
• Buyback Problem - Approximate Matroid Intersection with Cancellation Costs
• Online Minimization Knapsack Problem
• Optimal Resource Augmentations for Online Knapsack
• Online Submodular Maximization with Preemption
• Randomized Algorithms for Removable Online Knapsack Problems

This page was built for publication: Proportional Cost Buyback Problem with Weight Bounds