A note on the primal-dual and out-of-kilter algorithms for network optimization problems

DOI10.1002/NET.3230070106MaRDI QIDQ4132031zbMATH OpenOpenAlexFDO

Authors Jeremy F. Shapiro

Publication date 1977

Published in Networks (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/1721.1/5386

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Linear programming (90C05) Programming involving graphs or networks (90C35)

Cites work

• scientific article; zbMATH DE number 3177183 (Why is no real title available?)
• The analytic methods of operations research

Cited in

(1)

• The minimum cost flow problem: A unifying approach to dual algorithms and a new tree-search algorithm

This page was built for publication: A note on the primal-dual and out-of-kilter algorithms for network optimization problems

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