Solving the many to many assignment problem by improving the Kuhn-Munkres algorithm with backtracking (Q2634668): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5519710 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the Assignment and Transportation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Kuhn's Hungarian Method?A tribute from Hungary / rank
 
Normal rank
Property / cites work
 
Property / cites work: An extension of the Munkres algorithm for the assignment problem to rectangular matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incremental assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel synchronous and asynchronous implementations of the auction algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \(k\)-cardinality assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3953561 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Task decomposition, dynamic role assignment, and low-bandwidth communication for real-time strategic teamwork / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph matching using the interference of continuous-time quantum walks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new polynomial-time algorithm for linear programming / rank
 
Normal rank

Latest revision as of 10:36, 11 July 2024

scientific article
Language Label Description Also known as
English
Solving the many to many assignment problem by improving the Kuhn-Munkres algorithm with backtracking
scientific article

    Statements

    Solving the many to many assignment problem by improving the Kuhn-Munkres algorithm with backtracking (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    18 February 2016
    0 references
    assignment problem
    0 references
    many to many assignment
    0 references
    Kuhn-Munkres algorithm
    0 references
    Hungarian method
    0 references

    Identifiers