Combinatorial interior point methods for generalized network flow problems

DOI10.1007/s10107-002-0333-yzbMath1053.90135OpenAlexW2050789657MaRDI QIDQ1396212

Donald Goldfarb, Yi-Qing Lin

Publication date: 2002

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

Full work available at URL: https://doi.org/10.1007/s10107-002-0333-y

zbMATH Keywords

polynomial methodsinterior point methodscombinatorial methodsminimum cost flow problemcirculation problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Interior-point methods (90C51) Combinatorial optimization (90C27)

Related Items (1)

A Strongly Polynomial Algorithm for Generalized Flow Maximization

This page was built for publication: Combinatorial interior point methods for generalized network flow problems