Commitment Under Uncertainty: Two-Stage Stochastic Matching Problems
Authors:
- 25 August 2007
- book chapter
- Published by Springer Nature
- p. 171-182
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- Commitment under uncertainty: Two-stage stochastic matching problemsTheoretical Computer Science, 2008
- Approximation Algorithms for 2-Stage Stochastic Scheduling Problems2007
- A factor approximation algorithm for two-stage stochastic matching problemsEuropean Journal of Operational Research, 2006
- Approximation algorithms for 2-stage stochastic optimization problemsACM SIGACT News, 2006
- On the random 2‐stage minimum spanning treeRandom Structures & Algorithms, 2005
- Simultaneous MatchingsLecture Notes in Computer Science, 2005
- Hedging Uncertainty: Approximation Algorithms for Stochastic Optimization ProblemsLecture Notes in Computer Science, 2004
- The stochastic single resource service‐provision problemNaval Research Logistics (NRL), 2003
- Inapproximability Results for Bounded Variants of Optimization ProblemsLecture Notes in Computer Science, 2003
- Optimization, approximation, and complexity classesJournal of Computer and System Sciences, 1991