The stable crews problem (Q1827831): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2003.05.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2010307788 / rank
 
Normal rank
Property / cites work
 
Property / cites work: College Admissions and the Stability of Marriage / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3995616 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for the “stable roommates” problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Stable Roommates Problem with Ties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three-Dimensional Stabl Matching Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP-complete stable matching problems / rank
 
Normal rank

Latest revision as of 19:28, 6 June 2024

scientific article
Language Label Description Also known as
English
The stable crews problem
scientific article

    Statements

    The stable crews problem (English)
    0 references
    0 references
    0 references
    6 August 2004
    0 references
    0 references
    stable roommates problem
    0 references
    stable crews problem
    0 references
    polynomial algorithms
    0 references
    0 references