Online unweighted knapsack problem with removal cost
type: Item
instance of: scholarly article
title: Online unweighted knapsack problem with removal cost
zbMATH Open document ID: 1314.68410
author: Xin Han
author: Yasushi Kawase
author: Kazuhisa Makino
published in: Algorithmica
publication date: 2015-01-19T00:00:00Z
Mathematics Subject Classification ID: 68W27
Mathematics Subject Classification ID: 68W40
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 6387680
zbMATH Keywords: knapsack problem
zbMATH Keywords: online algorithms
zbMATH Keywords: competitive ratio
MaRDI profile type: Publication
full work available at URL: s00453-013-9822-z
OpenAlex ID: W2066898525
cites work: Buyback Problem - Approximate Matroid Intersection with Cancellation Costs
cites work: Q4633942
cites work: Online Minimization Knapsack Problem
cites work: Online removable knapsack with limited cuts
cites work: Q4737165
cites work: Optimal Resource Augmentations for Online Knapsack
cites work: Q4821303
cites work: Average-Case Analysis of Off-Line and On-Line Knapsack Problems
cites work: Stochastic on-line knapsack problems
DOI: 10.1007/S00453-013-9822-Z
description: scientific article; zbMATH DE number 6387680