Complexity of a 3-dimensional assignment problem (Q1837625): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3880581 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Timetable and Multicommodity Flow Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Solving 3-Dimensional Assignment Problems with Application to Scheduling a Teaching Practice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4142699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5643803 / rank
 
Normal rank

Latest revision as of 18:23, 13 June 2024

scientific article
Language Label Description Also known as
English
Complexity of a 3-dimensional assignment problem
scientific article

    Statements

    Complexity of a 3-dimensional assignment problem (English)
    0 references
    1983
    0 references
    0 references
    0 references
    0 references
    0 references
    3-dimensional assignment problem
    0 references
    bipartite graphs
    0 references
    perfect matchings
    0 references
    computational complexity
    0 references
    NP-completeness
    0 references
    0 references
    0 references
    0 references