A combinatorial interior point method for network flow problems

DOI10.1007/BF01580905zbMath0794.90017MaRDI QIDQ1196185

C. Wallacher, Uwe T. Zimmermann

Publication date: 17 December 1992

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

zbMATH Keywords

minimum cost flownegative circuit methodcombinatorial interior point method

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (2)

Recent developments in maximum flow algorithms ⋮ Solving MIPs via scaling-based augmentation

Cites Work

• Unnamed Item
• Unnamed Item
• A new polynomial-time algorithm for linear programming
• An algorithm for linear programming which requires \(O(((m+n)n^ 2+(m+n)^{1.5}n)L)\) arithmetic operations
• Polynomial affine algorithms for linear programming
• A POLYNOMIAL TIME INTERIOR POINT ALGORITHM FOR MINIMUM COST FLOW PROBLEMS
• Combinatorial Optimization with Rational Objective Functions

This page was built for publication: A combinatorial interior point method for network flow problems