Fortran subroutines for network flow optimization using an interior point algorithm

DOI10.1590/S0101-74382008000200005zbMath1257.90107OpenAlexW2106590694MaRDI QIDQ4905605

No author found.

Publication date: 19 February 2013

Published in: Pesquisa Operacional (Search for Journal in Brave)

Full work available at URL: http://www.scielo.br/scielo.php?script=sci_arttext&pid=S0101-74382008000200005&lng=en&nrm=isoce&tlng=en

zbMATH Keywords

optimizationconjugate gradient methodinterior point methodnetwork flow problemsFortran subroutines

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Interior-point methods (90C51) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)

Related Items

Minimum-cost flow algorithms: an experimental evaluation, A least-squares minimum-cost network flow algorithm, Solving scalarized multi-objective network flow problems using an interior point method, PDNET

Uses Software

• DIMACS

Cites Work

• Unnamed Item
• On the finite convergence of interior-point algorithms for linear programming
• Computational results of an interior point algorithm for large scale linear programming
• Finding an interior point in the optimal face of linear programs
• An Implementation of the Dual Affine Scaling Algorithm for Minimum-Cost Flow on Bipartite Uncapacitated Networks
• An Implementation of a Primal-Dual Interior Point Method for Linear Programming
• A Study of Indicators for Identifying Zero Variables in Interior-Point Methods
• An Investigation of Interior-Point Algorithms for the Linear Transportation Problem