Online Knapsack Problem Under Concave Functions

DOI10.1007/978-3-319-59605-1_10zbMath1430.68454OpenAlexW3107920931MaRDI QIDQ4632207

He Chen, Kazuhisa Makino, Ning Ma, Xin Han

Publication date: 26 April 2019

Published in: Frontiers in Algorithmics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-59605-1_10

Mathematics Subject Classification ID

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

Related Items

A general purpose exact solution method for mixed integer concave minimization problems ⋮ Online generalized assignment problem with historical information

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Online knapsack revisited
• The online knapsack problem with incremental capacity
• Online removable knapsack with limited cuts
• Randomized algorithms for online knapsack problems
• Online unweighted knapsack problem with removal cost
• Online minimization knapsack problem
• Stochastic on-line knapsack problems
• Online removable knapsack problem under convex function
• Optimal Resource Augmentations for Online Knapsack
• Finite-State Online Algorithms and Their Automated Competitive Analysis
• Proportional Cost Buyback Problem with Weight Bounds

This page was built for publication: Online Knapsack Problem Under Concave Functions