Online minimization knapsack problem
From MaRDI portal
Publication:897874
DOI10.1016/J.TCS.2015.09.021zbMATH Open1331.68299OpenAlexW2174718091MaRDI QIDQ897874FDOQ897874
Authors: Xin Han, Kazuhisa Makino 
Publication date: 8 December 2015
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2015.09.021
Recommendations
Online algorithms; streaming algorithms (68W27) Randomized algorithms (68W20) Combinatorial optimization (90C27)
Cites Work
- Title not available (Why is that?)
- Approximate minimization algorithms for the 0/1 knapsack and subset-sum problem
- Title not available (Why is that?)
- Online knapsack with resource augmentation
- Stochastic on-line knapsack problems
- Online knapsack revisited
- Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
- Title not available (Why is that?)
- Randomized algorithms for online knapsack problems
- Incremental medians via online bidding
- Online minimization knapsack problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Online removable knapsack with limited cuts
- Title not available (Why is that?)
- Finite-State Online Algorithms and Their Automated Competitive Analysis
- Searching in an unknown environment: An optimal randomized algorithm for the cow-path problem
- Online unweighted knapsack problem with removal cost
Cited In (18)
- Unit cost buyback problem
- Relaxing the irrevocability requirement for online graph algorithms
- Online knapsack revisited
- Online minimization knapsack problem
- Optimal online \(k\)-min search
- Randomized algorithms for online knapsack problems
- Online Knapsack Problems with Limited Cuts
- Randomized algorithms for removable online knapsack problems
- Online knapsack problem under concave functions
- Online knapsack of unknown capacity. How to optimize energy consumption in smartphones
- Online knapsack revisited
- Online Knapsack Problem Under Concave Functions
- Stable Approximation Algorithms for the Dynamic Broadcast Range-Assignment Problem
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems
- Online unweighted knapsack problem with removal cost
- Online knapsack problem with removal cost
- Online removable knapsack with limited cuts
- Proportional cost buyback problem with weight bounds
This page was built for publication: Online minimization knapsack problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q897874)
