Prim-based support-graph preconditioners for min-cost flow problems
- 21 February 2007
- journal article
- Published by Springer Nature in Computational Optimization and Applications
- Vol. 36 (2-3) , 271-287
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- A Computational Study of Cost Reoptimization for Min-Cost Flow ProblemsINFORMS Journal on Computing, 2006
- New Preconditioners for KKT Systems of Network Flow ProblemsSIAM Journal on Optimization, 2004
- Lagrangian heuristics based on disaggregated bundle methods for hydrothermal unit commitmentIEEE Transactions on Power Systems, 2003
- A Study of Preconditioners for Network Interior Point MethodsComputational Optimization and Applications, 2003
- Complexity classification of some edge modification problemsDiscrete Applied Mathematics, 2001
- Bundle-based relaxation methods for multicommodity capacitated fixed charge network designDiscrete Applied Mathematics, 2001
- Spectral Analysis of (Sequences of) Graph MatricesSIAM Journal on Matrix Analysis and Applications, 2001
- A Specialized Interior-Point Algorithm for Multicommodity Network FlowsSIAM Journal on Optimization, 2000
- A Bundle Type Dual-Ascent Approach to Linear Multicommodity Min-Cost Flow ProblemsINFORMS Journal on Computing, 1999
- Identifying the Optimal Face of a Network Linear Program with a Globally Convergent Interior Point Method1994