A polynomial dual simplex algorithm fot the generalized circulation problem.
From MaRDI portal
Publication:5957566
DOI10.1007/s101070100248zbMath1049.90107OpenAlexW2089403144MaRDI QIDQ5957566
Donald Goldfarb, Yi-Qing Lin, Zhiying Jin
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/s101070100248
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)
Related Items (4)
Shortest Path and Maximum Flow Problems in Networks with Additive Losses and Gains ⋮ Shortest path and maximum flow problems in networks with additive losses and gains ⋮ A Strongly Polynomial Algorithm for Generalized Flow Maximization ⋮ A simple GAP-canceling algorithm for the generalized maximum flow problem
This page was built for publication: A polynomial dual simplex algorithm fot the generalized circulation problem.