The stable crews problem

Discrete Applied Mathematics

Volumn 140, Issue 1-3, 2004, Pages 1-17

  Cechlárová, Katarína ^a   Ferková, Soňa ^b  

^a P J AFÁRIK UNIVERSITY   (Slovakia)

^b Tatra Banka a s   (Slovakia)

Author keywords

Polynomial algorithms; The stable crews problem; The stable roommates problem

Indexed keywords

AIRCRAFT; ALGORITHMS; COMPUTATIONAL COMPLEXITY; MATHEMATICAL MODELS; POLYNOMIALS;

POLYNOMIAL ALGORITHMS; THE STABLE CREWS PROBLEM; THE STABLE ROOMMATES PROBLEM;

PROBLEM SOLVING;

EID: 2642531158     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2003.05.003     Document Type: Article

References (6)

1. Gale D., Shapley L.S. College admissions and the stability of marriage. Amer. Math. Monthly. 69:1962;9-15.
2. Gusfield D., Irving R.W. The Stable Marriage Problem: Structure and Algorithms, Foundations of Computing. 1989;MIT Press, Cambridge, MA.
3. Irving R.W. An efficient algorithm for the stable roommates problem. J. Algorithms. 6:1985;577-595.
4. Irving R.W., Manlove D. The stable roommates problem with ties. J. Algorithms. 43:2002;85-105.
5. Ng Ch., Hirschberg D.S. Three-dimensional stable matching problems. SIAM J. Discrete Math. 4:1991;245-254.
6. Ronn E. NP-complete stable matching problems. J. Algorithms. 11:1990;285-304.