A hybrid algorithm for solving convex separable network flow problems
From MaRDI portal
Recommendations
- A hybrid algorithm for solving network flow problems with side constraints.
- A Newton method for convex separable network flow problems
- A composite algorithm for a concave-cost network flow problem
- A branch-and-bound algorithm for concave network flow problems
- The partitioned -relaxation algorithm for separable convex network flow problems
- A parametric algorithm for convex cost network flow and related problems
- An $\epsilon$-Relaxation Method for Separable Convex Cost Network Flow Problems
- scientific article; zbMATH DE number 1086904
- A combinatorial interior point method for network flow problems
- scientific article; zbMATH DE number 1342118
Cites work
- scientific article; zbMATH DE number 3833697 (Why is no real title available?)
- scientific article; zbMATH DE number 3869028 (Why is no real title available?)
- scientific article; zbMATH DE number 3687182 (Why is no real title available?)
- scientific article; zbMATH DE number 3690676 (Why is no real title available?)
- scientific article; zbMATH DE number 3748742 (Why is no real title available?)
- scientific article; zbMATH DE number 3466802 (Why is no real title available?)
- A Nonlinear Network Flow Algorithm for Maximization of Benefits in a Hydroelectric Power System
- A Primal Method for Minimal Cost Flows with Applications to the Assignment and Transportation Problems
- A note on a sufficient-decrease criterion for a non-derivative step-length procedure
- A scaled reduced gradient algorithm for network flow problems with convex separable costs
- A special spatial equilibrium problem
- Exceptional Paper—Design and Implementation of Large Scale Primal Transshipment Algorithms
- Implementation and Computational Study on an In-Core, Out-of-Core Primal Network Code
- Implementation and computational comparisons of primal, dual and primal-dual computer codes for minimum cost network flow problems
- Iteration and Sensitivity for a Spatial Equilibrium Problem with Linear Supply and Demand Functions
- Large-scale linearly constrained optimization
- NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
- New Finite Pivoting Rules for the Simplex Method
- Newton-type methods for unconstrained and linearly constrained optimization
- Secant approximation methods for convex optimization
- Solving the Pipe Network Analysis Problem Using Optimization Techniques
Cited in
(9)- A hybrid algorithm for solving network flow problems with side constraints.
- Multipoint methods for separable nonlinear networks
- A Newton method for convex separable network flow problems
- Implementing an “exact” Newton method for separable convex transportation problems
- A bilinear relaxation based algorithm for concave piecewise linear network flow problems
- Experiments with a hybrid interior point/combinatorial approach for network flow problems
- Separable convexification and DCA techniques for capacity and flow assignment problems.
- An exact separation algorithm for unsplittable flow capacitated network design arc-set polyhedron
- A simplex algorithm for network flow problems with piecewise linear fractional objective function
This page was built for publication: A hybrid algorithm for solving convex separable network flow problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3706799)
