A hybrid algorithm for solving convex separable network flow problems
From MaRDI portal
Publication:3706799
DOI10.1007/BF01918199zbMath0583.90025MaRDI QIDQ3706799
Publication date: 1985
Published in: Zeitschrift für Operations Research (Search for Journal in Brave)
hybrid algorithm; piecewise linearization; feasible direction method; convex separable pure network flow; modified Newton approaches
90C35: Programming involving graphs or networks
65K05: Numerical mathematical programming methods
90B10: Deterministic network models in operations research
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A special spatial equilibrium problem
- Secant approximation methods for convex optimization
- A Nonlinear Network Flow Algorithm for Maximization of Benefits in a Hydroelectric Power System
- A scaled reduced gradient algorithm for network flow problems with convex separable costs
- Iteration and Sensitivity for a Spatial Equilibrium Problem with Linear Supply and Demand Functions
- A note on a sufficient-decrease criterion for a non-derivative step-length procedure
- Newton-type methods for unconstrained and linearly constrained optimization
- NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
- Implementation and Computational Study on an In-Core, Out-of-Core Primal Network Code
- Exceptional Paper—Design and Implementation of Large Scale Primal Transshipment Algorithms
- Solving the Pipe Network Analysis Problem Using Optimization Techniques
- Large-scale linearly constrained optimization
- New Finite Pivoting Rules for the Simplex Method
- Implementation and computational comparisons of primal, dual and primal-dual computer codes for minimum cost network flow problems
- A Primal Method for Minimal Cost Flows with Applications to the Assignment and Transportation Problems
