STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
A Near-Optimal Solution to a Two-Dimensional Cutting Stock Problem
Mathematics of Operations Research
Computational Optimization and Applications
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Boosted sampling: approximation algorithms for stochastic optimization
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
An Edge in Time Saves Nine: LP Rounding Approximation Algorithms for Stochastic Network Design
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Stochastic Optimization is (Almost) as easy as Deterministic Optimization
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
On the random 2-stage minimum spanning tree
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Sampling-based Approximation Algorithms for Multi-stage Stochastic
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
How to Pay, Come What May: Approximation Algorithms for Demand-Robust Covering Problems
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Approximation Algorithms for 2-Stage Stochastic Scheduling Problems
IPCO '07 Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization
Stochastic steiner trees without a root
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
On two-stage stochastic minimum spanning trees
IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
Sampling bounds for stochastic optimization
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
Ad serving using a compact allocation plan
Proceedings of the 13th ACM Conference on Electronic Commerce
Flow-Based combinatorial chance constraints
CPAIOR'12 Proceedings of the 9th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Approximability of the two-stage stochastic knapsack problem with discretely distributed weights
Discrete Applied Mathematics
| Hi-index | 0.00 |
We define and study two versions of the bipartite matching problem in the framework of two-stage stochastic optimization with recourse. In one version the uncertainty is in the second stage costs of the edges, in the other version the uncertainty is in the set of vertices that needs to be matched. We prove lower bounds, and analyze efficient strategies for both cases. These problems model real-life stochastic integral planning problems such as commodity trading, reservation systems and scheduling under uncertainty.