Commitment Under Uncertainty: Two-Stage Stochastic Matching Problems
From MaRDI portal
Publication:5428807
DOI10.1007/978-3-540-73420-8_17zbMath1171.90489OpenAlexW1855012927MaRDI QIDQ5428807
Claire Kenyon-Mathieu, Eli Upfal, Irit Katriel
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
Related Items
Confidence-based reasoning in stochastic constraint programming ⋮ Approximability of the two-stage stochastic knapsack problem with discretely distributed weights ⋮ 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 ⋮ A Unified Framework for Multistage Mixed Integer Linear Optimization
This page was built for publication: Commitment Under Uncertainty: Two-Stage Stochastic Matching Problems
