An algorithm for optimizing network flow capacity under economies of scale (Q1843381): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
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: Q4103327 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5550828 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum cost routing for static network models / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Separable Nonconvex Programming Problems II: Nonconvex Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterative Solution of Nonlinear Optimal Control Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Validity of a Family of Optimization Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning procedures for solving mixed-variables programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Benders decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterization of local solutions for a class of nonconvex programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Separable Nonconvex Programming Problems / rank
 
Normal rank

Latest revision as of 13:34, 12 June 2024

scientific article
Language Label Description Also known as
English
An algorithm for optimizing network flow capacity under economies of scale
scientific article

    Statements

    Identifiers