The stable admissions polytope
From MaRDI portal
Publication:1575067
DOI10.1007/s101070050004zbMath0980.90073OpenAlexW2080307469MaRDI QIDQ1575067
Publication date: 9 November 2000
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s101070050004
Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)
Related Items (20)
Stability Representations of Many-to-One Matching Problems: An Integer Optimization Approach ⋮ Blockers and antiblockers of stable matchings ⋮ A branch-and-price algorithm for stable workforce assignments with hierarchical skills ⋮ Integer programming methods for special college admissions problems ⋮ Stable matching: An integer programming approach ⋮ Cutoff stability under distributional constraints with an application to summer internship matching ⋮ Marriage market with indifferences: a linear programming approach ⋮ Incorporating slot valuation in making airport slot scheduling decisions ⋮ On the stable \(b\)-matching polytope. ⋮ A note on the lattice structure for matching markets via linear programming ⋮ Fractional matching markets ⋮ Equitable representation and recruitment ⋮ On the set of many-to-one strongly stable fractional matchings ⋮ Affinely representable lattices, stable matchings, and choice functions ⋮ The stable \(b\)-matching polytope revisited ⋮ Affinely representable lattices, stable matchings, and choice functions ⋮ Stable multi-skill workforce assignments ⋮ Finding All Stable Pairs and Solutions to the Many-to-Many Stable Matching Problem ⋮ College admissions with ties and common quotas: integer programming approach ⋮ Lattice structure of the random stable set in many-to-many matching markets
This page was built for publication: The stable admissions polytope
