Commitment Under Uncertainty: Two-Stage Stochastic Matching Problems

DOI10.1007/978-3-540-73420-8_17MaRDI QIDQ5428807zbMATH OpenOpenAlexFDO

Authors Irit Katriel, Claire Kenyon-Mathieu, Eli Upfal

Publication date 28 November 2007

Published in Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.95.1115

Mathematics Subject Classification ID

Stochastic programming (90C15) Matching models (91B68)

Recommendations

• Commitment under uncertainty: Two-stage stochastic matching problems
• A factor \(\frac {1}{2}\) approximation algorithm for two-stage stochastic matching problems
• Stochastic matching with commitment
• Two-stage stochastic matching and spanning tree problems: polynomial instances and approximation
• When LP is the cure for your matching woes: improved bounds for stochastic matchings

Cited in

(7)

• A randomized algorithm for the min-Max selecting items problem with uncertain weights
• Two-stage stochastic matching and spanning tree problems: polynomial instances and approximation
• Approximability of the two-stage stochastic knapsack problem with discretely distributed weights
• A factor \(\frac {1}{2}\) approximation algorithm for two-stage stochastic matching problems
• A unified framework for multistage mixed integer linear optimization
• Confidence-based reasoning in stochastic constraint programming
• Commitment under uncertainty: Two-stage stochastic matching problems

This page was built for publication: Commitment Under Uncertainty: Two-Stage Stochastic Matching Problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5428807)