Multistage knapsack
From MaRDI portal
Publication:2119404
DOI10.1016/j.jcss.2022.01.002zbMath1489.90147arXiv1901.11260OpenAlexW4207045971MaRDI QIDQ2119404
Evripidis Bampis, Alexandre Teiller, Bruno Escoffier
Publication date: 29 March 2022
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1901.11260
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Approximation algorithms (68W25)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Approximation algorithms for the m-dimensional 0-1 knapsack problem: Worst-case and probabilistic analyses
- A fully polynomial approximation algorithm for the 0-1 knapsack problem
- A new fully polynomial time approximation scheme for the Knapsack problem
- Approximation algorithms for knapsack problems with cardinality constraints
- Offline and online facility leasing
- Unified Algorithms for Online Learning and Competitive Analysis
- Dynamic Sum-Radii Clustering
- The Power of Deferral: Maintaining a Constant-Competitive Steiner Tree Online
- Fast Approximation Algorithms for Knapsack Problems
- Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
- On the Tradeoff between Stability and Fit
- Dynamic Facility Location via Exponential Clocks
- Changing Bases: Multistage Optimization for Matroids and Matchings
- Facility Location in Evolving Metrics
- Competitive Analysis via Regularization
- Infrastructure Leasing Problems
- Multistage Vertex Cover
- The Power of Recourse for Online MST and TSP
This page was built for publication: Multistage knapsack
