An Implementation of the Dual Affine Scaling Algorithm for Minimum-Cost Flow on Bipartite Uncapacitated Networks

DOI10.1137/0803025zbMath0794.90014MaRDI QIDQ3140000

Mauricio G. C. Resende, Geraldo Veiga

Publication date: 6 December 1993

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0803025

zbMATH Keywords

interior point algorithm; minimum-cost flow; dual affine scaling algorithm; bipartite uncapacitated networks; preconditional conjugate gradient algorithm; randomly generated assignment problems

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

65K05: Numerical mathematical programming methods

90C06: Large-scale problems in mathematical programming

90C05: Linear programming

90B10: Deterministic network models in operations research

65F10: Iterative numerical methods for linear systems

90B80: Discrete location and assignment

65Y05: Parallel numerical computation

90-08: Computational methods for problems pertaining to operations research and mathematical programming

Related Items

Unnamed Item, Experiments with a hybrid interior point/combinatorial approach for network flow problems, Fuzzy goal programming: complementary slackness conditions and computational schemes, Convergence analysis of the inexact infeasible interior-point method for linear optimization, Gigaflops in linear programming, Descent direction algorithm with multicommodity flow problem for signal optimization and traffic assignment jointly, Some concepts of the fuzzy multicommodity flow problem and their application in fuzzy network design, An interior-point approach for primal block-angular problems, Prim-based support-graph preconditioners for min-cost flow problems, Using a hybrid preconditioner for solving large-scale linear systems arising from interior point methods, Solving scalarized multi-objective network flow problems using an interior point method

Uses Software

• KORBX
• MINOS
• NETGEN
• RELAX4