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

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q1577015
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Alan M. Frieze / rank
 
Normal rank
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/0377-2217(83)90078-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1965178295 / rank
 
Normal rank
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