The online knapsack problem with incremental capacity
type: Item
instance of: scholarly article
title: The online knapsack problem with incremental capacity
zbMATH Open document ID: 1346.90722
author: Clemens Thielen
author: Morten Tiedemann
author: Stephan Westphal
published in: Mathematical Methods of Operations Research
publication date: 2016-05-17T00:00:00Z
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 6581178
zbMATH Keywords: online optimization
zbMATH Keywords: competitive analysis
zbMATH Keywords: knapsack problems
zbMATH Keywords: dynamic capacity
MaRDI profile type: Publication
full work available at URL: s00186-015-0526-9
OpenAlex ID: W2214256523
cites work: On-line competitive algorithms for call admission in optical networks
cites work: A Knapsack Secretary Problem with Applications
cites work: Q4223058
cites work: Packing a Knapsack of Unknown Capacity
cites work: Q4230356
cites work: Randomized algorithms for online knapsack problems
cites work: An Incremental Model for Combinatorial Maximization Problems
cites work: Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
cites work: Constant-Time Approximation Algorithms for the Knapsack Problem
cites work: Q4737165
cites work: Optimal Resource Augmentations for Online Knapsack
cites work: Reducibility among Combinatorial Problems
cites work: Q4821303
cites work: The dynamic and stochastic knapsack problem
cites work: Average-Case Analysis of Off-Line and On-Line Knapsack Problems
cites work: Stochastic on-line knapsack problems
cites work: Q3993418
cites work: Instance-sensitive robustness guarantees for sequencing with unknown packing and covering constraints
cites work: The Dynamic and Stochastic Knapsack Problem with Deadlines
cites work: Finite Horizon Stochastic Knapsacks with Applications to Yield Management
DOI: 10.1007/S00186-015-0526-9
description: scientific article; zbMATH DE number 6581178