The stable crews problem

DOI10.1016/j.dam.2003.05.003zbMath1069.90086OpenAlexW2010307788MaRDI QIDQ1827831

Soňa Ferková, Katarína Cechlárova

Publication date: 6 August 2004

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2003.05.003

zbMATH Keywords

polynomial algorithmsstable roommates problemstable crews problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27)

Related Items (6)

A new solution concept for the roommate problem: \(\mathcal{Q}\)-stable matchings ⋮ The reduction of computation times of upper and lower tolerances for selected combinatorial optimization problems ⋮ Balancing stability and efficiency in team formation as a generalized roommate problem ⋮ The integral stable allocation problem on graphs ⋮ On the stable \(b\)-matching problem in multigraphs ⋮ Rotations in the stable \(b\)-matching problem

Cites Work

• Unnamed Item
• The Stable Roommates Problem with Ties
• Three-Dimensional Stabl Matching Problems
• NP-complete stable matching problems
• An efficient algorithm for the “stable roommates” problem
• College Admissions and the Stability of Marriage

This page was built for publication: The stable crews problem