Optimal expansion of capacitated transshipment networks (Q1266668): 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 algorithm for optimizing network flow capacity under economies of scale / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal expansion of an existing network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiobjective programming and planning / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simplex algorithm for piecewise-linear programming I: Derivation and proof / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simplex algorithm for piecewise-linear programming. II: Finiteness, feasibility and degeneracy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Increasing the Capacity of a Network: The Parametric Budget Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5563223 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3968758 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4039868 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5550828 / rank
 
Normal rank

Latest revision as of 15:36, 28 May 2024

scientific article
Language Label Description Also known as
English
Optimal expansion of capacitated transshipment networks
scientific article

    Statements

    Optimal expansion of capacitated transshipment networks (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    7 October 1998
    0 references
    simplex method
    0 references
    parametric analysis
    0 references
    transshipment network
    0 references
    capacity expansion
    0 references
    piecewise linear convex functions
    0 references

    Identifiers