Solving (large scale) matching problems combinatorially (Q750322): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Assignment and matching problems: solution methods with FORTRAN-programs. In cooperation with T. Bönniger and G. Katzakidis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3678967 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving large-scale matching problems efficiently: A new primal matching approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the use of optimal fractional matchings for solving the (integer) matching problem / rank
 
Normal rank
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: Maximum matching and a polyhedron with 0,1-vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: The zero pivot phenomenon in transportation and assignment problems and its computational implications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving matching problems with linear programming / rank
 
Normal rank

Revision as of 11:32, 21 June 2024

scientific article
Language Label Description Also known as
English
Solving (large scale) matching problems combinatorially
scientific article

    Statements

    Solving (large scale) matching problems combinatorially (English)
    0 references
    0 references
    0 references
    1991
    0 references
    fast matching algorithms
    0 references
    computational results
    0 references
    shortest augmenting path
    0 references
    large scale matching
    0 references
    assignment start procedure
    0 references
    two-phase strategy
    0 references
    sparse subgraph
    0 references

    Identifiers

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