Online Knapsack Problem Under Concave Functions

DOI10.1007/978-3-319-59605-1_10zbMATH Open1430.68454OpenAlexW3107920931MaRDI QIDQ4632207FDOQ4632207

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

Recommendations

• Online knapsack problem under concave functions
• Online removable knapsack problem under convex function
• Online minimization knapsack problem
• Online minimization knapsack problem
• Online knapsack revisited
• Online knapsack revisited
• The online knapsack problem with incremental capacity
• Online Knapsack Problems with Limited Cuts
• Stochastic on-line knapsack problems

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (4)

• A general purpose exact solution method for mixed integer concave minimization problems
• Online Knapsack Problems with Limited Cuts
• Online knapsack problem under concave functions
• Online generalized assignment problem with historical information

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

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