arXiv (All)
open access
Capacity Modification for Matching with Couples: An Integer Programming and Computational Study
We study capacity modification in the Hospitals/Residents problem with Couples, in which hospital capacities and a stable matching are jointly determined. Exact and Cutoff integer programming formulations are developed for the resulting problem. We assume that, for each couple, either both members a
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Stable Matchings with Minimum Utility Gap#1155259
- Couples can be Tractable: New Algorithms and Hardness Results for the Hospitals/Residents Problem with Couples.#975803
- Computing Stable Matchings under Complementarities and Preference Misalignment#1202756
- The Popular Dimension of Matchings#971711
- A Matroid Generalization of Weighted Popular Matching: Characterization and Algorithm#1342953
Record · ID 1448309
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive