Online knapsack problem with removal cost

DOI10.1007/978-3-642-32241-9_6MaRDI QIDQ2914312zbMATH OpenOpenAlexFDO

Authors Xin Han, Yasushi Kawase, Kazuhisa Makino

Publication date 25 September 2012

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-32241-9_6

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Analysis of algorithms (68W40) Combinatorial optimization (90C27)

Recommendations

• Online unweighted knapsack problem with removal cost
• Online minimization knapsack problem
• Online minimization knapsack problem
• Randomized algorithms for removable online knapsack problems
• Online knapsack with resource augmentation

Cited in

(9)

• Online knapsack with resource augmentation
• Online removable knapsack problems for integer-sized items
• Clairvoyant mechanisms for online auctions
• Online minimization knapsack problem
• scientific article; zbMATH DE number 2086630 (Why is no real title available?)
• Randomized algorithms for online knapsack problems
• Online unweighted knapsack problem with removal cost
• Any-order online interval selection
• Online minimization knapsack problem

Describes a project that uses

Uses Software

• Knapsack

This page was built for publication: Online knapsack problem with removal cost

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2914312)