The alternating basis algorithm for assignment problems (Q4159200): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Enhancements Of Spanning Tree Labelling Procedures For Network Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved version of the out-of-kilter method and a comparative study of computer codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A network simplex method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementation and computational comparisons of primal, dual and primal-dual computer codes for minimum cost network flow problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Computation Study on Start Procedures, Basis Change Criteria, and Solution Algorithms for Transportation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Augmented Threaded Index Method For Network Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benefit-Cost Analysis of Coding Techniques for the Primal Transportation Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accelerated Algorithms for Labeling and Relabeling of Trees, with Applications to Distribution Problems / rank
 
Normal rank

Latest revision as of 22:34, 12 June 2024

scientific article; zbMATH DE number 3590081
Language Label Description Also known as
English
The alternating basis algorithm for assignment problems
scientific article; zbMATH DE number 3590081

    Statements

    Identifiers

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