Solution of large dense transportation problems using a parallel primal algorithm (Q922946): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
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: Benefit-Cost Analysis of Coding Techniques for the Primal Transportation Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exceptional Paper—Design and Implementation of Large Scale Primal Transshipment Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Results from a parallel branch-and-bound algorithm for the asymmetric traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A parallel branch and bound algorithm for solving large asymmetric traveling salesman problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4001523 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3968758 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The auction algorithm: A distributed relaxation method for the assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A parallel shortest augmenting path algorithm for the assignment problem / rank
 
Normal rank

Latest revision as of 11:59, 21 June 2024

scientific article
Language Label Description Also known as
English
Solution of large dense transportation problems using a parallel primal algorithm
scientific article

    Statements

    Solution of large dense transportation problems using a parallel primal algorithm (English)
    0 references
    1990
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    primal transportation algorithm
    0 references
    assignment problems
    0 references
    0 references
    0 references
    0 references
    0 references