The following pages link to The stable admissions polytope (Q1575067):
Displaying 20 items.
- A branch-and-price algorithm for stable workforce assignments with hierarchical skills (Q322747) (← links)
- Integer programming methods for special college admissions problems (Q346530) (← links)
- Fractional matching markets (Q516999) (← links)
- Equitable representation and recruitment (Q537577) (← links)
- Stable multi-skill workforce assignments (Q744637) (← links)
- On the stable \(b\)-matching polytope. (Q1414822) (← links)
- The stable \(b\)-matching polytope revisited (Q1801060) (← links)
- On the set of many-to-one strongly stable fractional matchings (Q2019364) (← links)
- College admissions with ties and common quotas: integer programming approach (Q2077946) (← links)
- Lattice structure of the random stable set in many-to-many matching markets (Q2078071) (← links)
- A note on the lattice structure for matching markets via linear programming (Q2246170) (← links)
- Blockers and antiblockers of stable matchings (Q2637344) (← links)
- Marriage market with indifferences: a linear programming approach (Q2687690) (← links)
- Finding All Stable Pairs and Solutions to the Many-to-Many Stable Matching Problem (Q2815443) (← links)
- Stability Representations of Many-to-One Matching Problems: An Integer Optimization Approach (Q5060805) (← links)
- Affinely representable lattices, stable matchings, and choice functions (Q5918423) (← links)
- Affinely representable lattices, stable matchings, and choice functions (Q5925643) (← links)
- Stable matching: An integer programming approach (Q6053647) (← links)
- Cutoff stability under distributional constraints with an application to summer internship matching (Q6120933) (← links)
- Incorporating slot valuation in making airport slot scheduling decisions (Q6167429) (← links)