Online Knapsack Problems with Limited Cuts

DOI10.1007/978-3-642-10631-6_36MaRDI QIDQ3652222zbMATH OpenOpenAlexFDO

Authors Xin Han, Kazuhisa Makino

Publication date 17 December 2009

Published in Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-10631-6_36

Mathematics Subject Classification ID

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

Recommendations

• Online knapsack revisited
• Online knapsack revisited
• Online minimization knapsack problem
• Online minimization knapsack problem
• The online knapsack problem with incremental capacity
• Online knapsack problem under concave functions
• Online Knapsack Problem Under Concave Functions
• scientific article; zbMATH DE number 7650261
• Randomized algorithms for online knapsack problems
• scientific article; zbMATH DE number 4047112

Cited in

(8)

• Online knapsack problem under concave functions
• Online knapsack of unknown capacity. How to optimize energy consumption in smartphones
• Online removable knapsack problem under convex function
• Online resource management
• 2D knapsack: packing squares
• Online Maximum Directed Cut
• Online removable knapsack with limited cuts
• Online Knapsack Problem Under Concave Functions

Describes a project that uses

Uses Software

• Knapsack

This page was built for publication: Online Knapsack Problems with Limited Cuts

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