The stable admissions polytope
From MaRDI portal
Publication:1575067
DOI10.1007/s101070050004zbMath0980.90073MaRDI 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
52B12: Special polytopes (linear programming, centrally symmetric, etc.)
90C10: Integer programming
90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut
90C27: Combinatorial optimization
Related Items
Stability Representations of Many-to-One Matching Problems: An Integer Optimization Approach, Affinely representable lattices, stable matchings, and choice functions, Affinely representable lattices, stable matchings, and choice functions, Stable matching: An integer programming approach, Cutoff stability under distributional constraints with an application to summer internship matching, Incorporating slot valuation in making airport slot scheduling decisions, A branch-and-price algorithm for stable workforce assignments with hierarchical skills, Integer programming methods for special college admissions problems, Fractional matching markets, Equitable representation and recruitment, Stable multi-skill workforce assignments, On the stable \(b\)-matching polytope., The stable \(b\)-matching polytope revisited, On the set of many-to-one strongly stable fractional matchings, College admissions with ties and common quotas: integer programming approach, Lattice structure of the random stable set in many-to-many matching markets, A note on the lattice structure for matching markets via linear programming, Blockers and antiblockers of stable matchings, Marriage market with indifferences: a linear programming approach, Finding All Stable Pairs and Solutions to the Many-to-Many Stable Matching Problem
