Implementation and test of auction methods for solving generalized network flow problems with separable convex cost (Q1810926): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: An \(\varepsilon\)-relaxation method for separable convex cost generalized network flow problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4845363 / rank
 
Normal rank
Property / cites work
 
Property / cites work: OR Practice—Large-Scale Nonlinear Network Models and Their Application / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonlinear cost network models in transportation analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4225395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3730336 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dual coordinate step methods for linear network flow problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Minimum-Cost Circulations by Successive Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: An $\epsilon$-Relaxation Method for Separable Convex Cost Network Flow Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The partitioned \(\varepsilon\)-relaxation algorithm for separable convex network flow problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4363162 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An implementation of linear and nonlinear multicommodity network flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: LSNNO, a FORTRAN subroutine for solving large-scale nonlinear network optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relaxation methods for monotropic programs / 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

Latest revision as of 16:28, 5 June 2024

scientific article
Language Label Description Also known as
English
Implementation and test of auction methods for solving generalized network flow problems with separable convex cost
scientific article

    Statements

    Implementation and test of auction methods for solving generalized network flow problems with separable convex cost (English)
    0 references
    9 June 2003
    0 references
    Generalized network flow
    0 references
    \(\varepsilon\)-relaxation method
    0 references
    auction sequential shortest path algorithm
    0 references
    implementation
    0 references
    computation
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers