The relax codes for linear minimum cost network flow problems

DOI10.1007/BF02288322MaRDI QIDQ5978887FDO

Authors Dimitri P. Bertsekas, Paul Tseng

Publication date December 1988

Published in Annals of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF02288322

Cited in

(1)

• tightenBlock

This page was built for publication: The relax codes for linear minimum cost network flow problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5978887)