Incremental assignment problem (Q865928): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4040780 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Selected topics on assignment problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Minimum-Weight Perfect Matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths, Trees, and Flowers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum matching and a polyhedron with 0,1-vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network Flow and Testing Graph Connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster scaling algorithms for general graph matching problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138921 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for finding maximum matching in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient dual simplex algorithms for the assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Decomposition Theorem for Maximum Weight Bipartite Matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5519710 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the weighted matching with penalty problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4130999 / 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: New scaling algorithms for the assignment and minimum mean cycle problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4871750 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal algorithm for solving the searchlight guarding problem on weighted interval graphs / rank
 
Normal rank

Latest revision as of 14:06, 25 June 2024

scientific article
Language Label Description Also known as
English
Incremental assignment problem
scientific article

    Statements

    Incremental assignment problem (English)
    0 references
    0 references
    0 references
    20 February 2007
    0 references
    weighted bipartite graph
    0 references
    Hungarian algorithm
    0 references
    maximum-weighted matching
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references