Maximum-expectation matching under recourse
From MaRDI portal
Cites work
- A factor \(\frac {1}{2}\) approximation algorithm for two-stage stochastic matching problems
- Approximating Matches Made in Heaven
- Beating \((1 - 1/e)\)-approximation for weighted stochastic matching
- Beating greedy for stochastic bipartite matching
- Cutting Plane Approaches for the Robust Kidney Exchange Problem
- Efficient algorithms for finding maximum matching in graphs
- Finding all minimum-cost perfect matchings in Bipartite graphs
- Ignorance is almost bliss: near-optimal stochastic matching with few queries
- Improved instance generation for kidney exchange programmes
- Matching with our eyes closed
- Maximising expectation of the number of transplants in kidney exchange programmes
- Maximum matching and a polyhedron with 0,1-vertices
- Maximum weight cycle packing in directed graphs, with application to kidney exchange programs
- New insights on integer-programming models for the kidney exchange problem
- Paths, Trees, and Flowers
- Robust Models for the Kidney Exchange Problem
- TWO THEOREMS IN GRAPH THEORY
- When LP is the cure for your matching woes: improved bounds for stochastic matchings
This page was built for publication: Maximum-expectation matching under recourse
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6981415)