Experiments with a hybrid interior point/combinatorial approach for network flow problems

DOI10.1080/00207160600848017zbMath1177.90287OpenAlexW1965270812WikidataQ118165495 ScholiaQ118165495MaRDI QIDQ5436921

Antonio Frangioni, Claudio Gentile

Publication date: 18 January 2008

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160600848017

zbMATH Keywords

relaxation methodinterior point algorithmscrossovermin cost flow problems

Mathematics Subject Classification ID

Linear programming (90C05) Interior-point methods (90C51) Deterministic network models in operations research (90B10)

Related Items

Prim-based support-graph preconditioners for min-cost flow problems, Computational evaluation of multi-iterative approaches for solving graph-structured large linear systems, Bundle methods for sum-functions with ``easy components: applications to multicommodity network design, Improving an interior-point approach for large block-angular problems by hybrid preconditioners

Uses Software

• PDNET
• RelaxIV
• DIMACS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A study of preconditioners for network interior point methods
• A Computational Study of Cost Reoptimization for Min-Cost Flow Problems
• An Implementation of the Dual Affine Scaling Algorithm for Minimum-Cost Flow on Bipartite Uncapacitated Networks
• On the Implementation of a Primal-Dual Interior Point Method
• On Finding Primal- and Dual-Optimal Bases
• Combining Interior-Point and Pivoting Algorithms for Linear Programming
• A Bundle Type Dual-Ascent Approach to Linear Multicommodity Min-Cost Flow Problems
• A Specialized Interior-Point Algorithm for Multicommodity Network Flows
• New Preconditioners for KKT Systems of Network Flow Problems