scientific article; zbMATH DE number 6469210
From MaRDI portal
Publication:5501328
Recommendations
- Approximation algorithms for stochastic combinatorial optimization problems
- Approximation algorithms for a class of stochastic selection problems with reward and cost considerations
- Approximation algorithms for reliable stochastic combinatorial optimization
- Approximation Algorithms for 2-Stage Stochastic Scheduling Problems
- On the optimality of exact and approximation algorithms for scheduling problems
- Approximating incremental combinatorial optimization problems
- scientific article; zbMATH DE number 1060044
- As soon as probable: optimal scheduling under stochastic uncertainty
- Approximation in Preemptive Stochastic Online Scheduling
- scientific article; zbMATH DE number 2077129
Cited in
(25)- Improved bounds in stochastic matching and optimization
- A priori TSP in the scenario model
- Two-stage robust network design with exponential scenarios
- Provision-after-wait with preferences ordered by difference: tighter complexity and better approximation
- On the power of static assignment policies for robust facility location problems
- Two-stage stochastic matching and spanning tree problems: polynomial instances and approximation
- Approximability of the two-stage stochastic knapsack problem with discretely distributed weights
- Hedging uncertainty: approximation algorithms for stochastic optimization problems
- Improved approximations for two-stage MIN-cut and shortest path problems under uncertainty
- Approximation algorithms for stochastic combinatorial optimization problems
- A priori TSP in the Scenario Model
- Probabilistic models for the Steiner tree problem
- K-adaptability in two-stage robust binary programming
- Thresholded covering algorithms for robust and max-min optimization
- Approximation algorithms for stochastic and risk-averse optimization
- Sampling-based approximation schemes for capacitated stochastic inventory control models
- Deterministic sampling algorithms for network design
- Permutation betting markets: singleton betting with extra information
- scientific article; zbMATH DE number 7650071 (Why is no real title available?)
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Total completion time scheduling under scenarios
- Towards distributed two-stage stochastic optimization
- An o( n)-approximation for submodular facility location
- Total completion time scheduling under scenarios
- Commitment under uncertainty: Two-stage stochastic matching problems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5501328)
