An algorithm for optimizing network flow capacity under economies of scale
From MaRDI portal
Publication:1843381
DOI10.1007/BF00933746zbMath0281.90077MaRDI QIDQ1843381
P. P. Bansal, Stephen E. Jacobsen
Publication date: 1975
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)
Related Items
Construction of test problems for a class of reverse convex programs, On solving general reverse convex programming problems by a sequence of linear programs and line searches, Intersection Disjunctions for Reverse Convex Sets, Linear programs with an additional reverse convex constraint, Reverse convex programming, A finite cutting plane method for solving linear programs with an additional reverse convex constraint, On the use of cuts in reverse convex programs, On a finite branch and bound algorithm for the global minimization of a concave power law over a polytope, Nondifferentiable reverse convex programs and facetial convexity cuts via a disjunctive characterization, A Lagrangian relaxation approach for stochastic network capacity expansion with budget constraints, Optimal expansion of capacitated transshipment networks, A level set algorithm for a class of reverse convex programs, Computational experience using an edge search algorithm for linear reverse convex programs, A parametric algorithm for convex cost network flow and related problems
Cites Work
- Unnamed Item
- Unnamed Item
- Partitioning procedures for solving mixed-variables programming problems
- Characterization of local solutions for a class of nonconvex programs
- Generalized Benders decomposition
- Increasing the Capacity of a Network: The Parametric Budget Problem
- An Algorithm for Separable Nonconvex Programming Problems
- The Validity of a Family of Optimization Methods
- An Algorithm for Separable Nonconvex Programming Problems II: Nonconvex Constraints
- Minimum cost routing for static network models
- Iterative Solution of Nonlinear Optimal Control Problems