Linear assignment procedures (Q1610146): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: An in-core/out-of-core method for solving large scale assignment problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient cost scaling algorithm for the assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4283456 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A shortest augmenting path algorithm for dense and sparse linear assignment problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Shortest Augmenting Path Algorithm for the Semi-Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved complexity bound for the maximum cardinality bottleneck bipartite matching problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On some techniques useful for solution of transportation network problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear and semi-assignment problems: A core oriented approach / rank
 
Normal rank

Revision as of 14:03, 4 June 2024

scientific article
Language Label Description Also known as
English
Linear assignment procedures
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references