Online knapsack problems with estimates
From MaRDI portal
Cites work
- Distortion-oblivious algorithms for minimizing flow time
- Distortion-oblivious algorithms for scheduling on multiple machines
- Exact solution of the robust knapsack problem
- Flow time scheduling with uncertain processing time
- scientific article; zbMATH DE number 1232130 (Why is no real title available?)
- scientific article; zbMATH DE number 2086630 (Why is no real title available?)
- scientific article; zbMATH DE number 7650261 (Why is no real title available?)
- Learning-augmented algorithms for online subset sum
- Learning-augmented query policies for minimum spanning tree with uncertainty
- Online interval scheduling with predictions
- Online knapsack with resource augmentation
- Online Metric Algorithms with Untrusted Predictions
- Online minimum spanning trees with weight predictions
- Online removable knapsack with limited cuts
- Online Scheduling via Learned Weights
- Online simple knapsack with bounded predictions
- Online simple knapsack with reservation costs
- Online unit profit knapsack with predictions
- Random knapsack in expected polynomial time
- Removable online knapsack and advice
- Smoothed analysis of algorithms: why the simplex algorithm usually takes polynomial time
- Stochastic on-line knapsack problems
- Strategyproof scheduling with predictions
- The online knapsack problem with incremental capacity
- The online knapsack problem: advice and randomization
- The online simple knapsack problem with reservation and removability
This page was built for publication: Online knapsack problems with estimates
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7310171)
