Algorithm for the solution of the assignment problem for sparse matrices (Q1838425): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Giorgio Carpaneto / rank
 
Normal rank
Property / author
 
Property / author: Paolo Toth / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Algorithm 548 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4091421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The alternating basis algorithm for assignment problems / rank
 
Normal rank
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: Some New Branching and Bounding Criteria for the Asymmetric Travelling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5519710 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3048571 / rank
 
Normal rank

Latest revision as of 18:30, 13 June 2024

scientific article
Language Label Description Also known as
English
Algorithm for the solution of the assignment problem for sparse matrices
scientific article

    Statements

    Algorithm for the solution of the assignment problem for sparse matrices (English)
    0 references
    0 references
    0 references
    1983
    0 references
    0 references
    sparse matrices
    0 references
    efficient algorithm
    0 references
    assignment problem
    0 references
    computational results
    0 references
    FORTRAN program
    0 references
    0 references
    0 references