Commitment under uncertainty: Two-stage stochastic matching problems

DOI10.1016/j.tcs.2008.08.010zbMath1165.90583OpenAlexW2044027392MaRDI QIDQ959814

Eli Upfal, Irit Katriel, Claire Kenyon-Mathieu

Publication date: 12 December 2008

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2008.08.010

zbMATH Keywords

matching algorithmstochastic combinatorial optimization

Mathematics Subject Classification ID

Stochastic programming (90C15) Combinatorial optimization (90C27)

Related Items (11)

Robust two-stage combinatorial optimization problems under convex second-stage cost uncertainty ⋮ Online spatio-temporal matching in stochastic and dynamic domains ⋮ Robust recoverable and two-stage selection problems ⋮ On recoverable and two-stage robust selection problems with budgeted uncertainty ⋮ Approximating combinatorial optimization problems with the ordered weighted averaging criterion ⋮ On the approximability of robust spanning tree problems ⋮ Robust two-stage combinatorial optimization problems under discrete demand uncertainties and consistent selection constraints ⋮ Combinatorial two-stage minmax regret problems under interval uncertainty ⋮ When LP is the cure for your matching woes: improved bounds for stochastic matchings ⋮ Risk Averse Scheduling with Scenarios ⋮ Two-stage combinatorial optimization problems under risk

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization, approximation, and complexity classes
• The sample average approximation method applied to stochastic routing problems: a computational study
• A factor \(\frac {1}{2}\) approximation algorithm for two-stage stochastic matching problems
• A Near-Optimal Solution to a Two-Dimensional Cutting Stock Problem
• Boosted sampling
• On Two-Stage Stochastic Minimum Spanning Trees
• Introduction to Stochastic Programming
• The stochastic single resource service-provision problem
• Approximation Algorithms for 2-Stage Stochastic Scheduling Problems
• Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
• Integer Programming and Combinatorial Optimization
• Automata, Languages and Programming
• Algorithms and Computation
• Fundamentals of Computation Theory

This page was built for publication: Commitment under uncertainty: Two-stage stochastic matching problems