Linear network optimization
by Dimitri P. Bertsekas · first published 1991
3mentions
1recommended by
3HN commenters
2011–2019first – last mentioned
33% recommend67% neutral
Affiliate links. As an Amazon Associate I earn from qualifying purchases.
…Cunningham, long at Waterloo, we can avoid cycling. But, the simplex algorithm for least cost network flows, as far as I know, is not guaranteed, worst case polynomial. However, read: Dimitri P. Bertsekas, 'Linear Network Optimization: Algorithms and Codes', ISBN 0-262-02334-2, MIT Press, Cambridge, MA, 1991. and in there, or elsewhere in Bertsekas's work, is an algorithm for least cost network flows and that is worst case polynomial.…
on “"Computer Science" is Not Science and "Software Engineering" is Not Engineering” ↗…Holland, 1983. Cunningham has long been at the Waterloo department of Combinatorics and Optimization. Then, too, there is the guaranteed polynomial algorithm of D. Bertsekas. See: Dimitri P. Bertsekas, 'Linear Network Optimization: Algorithms and Codes', ISBN 0-262-02334-2, MIT Press, Cambridge, MA, 1991. But, if Google calls you, don't mention such things if you want a job! Instead, just mumble on about how great C++ is! "Oh,…
on “A note to Google recruiters (and on Google hiring practices)” ↗…Programming and Network Flows,\/} ISBN 0-471-06015-1, John Wiley and Sons, New York, 1977.\ \ G.\ Hadley, {\it Linear Programming,\/} Addison-Wesley, Reading, MA, 1962.\ \ Dimitri P.\ Bertsekas, {\it Linear Network Optimization: Algorithms and Codes,\/} ISBN 0-262-02334-2, MIT Press, Cambridge, MA, 1991.\ \ Saul I.\ Gass, {\it Linear Programming: Methods and Applications, Third Edition,\/} McGraw-Hill, New York, 1969.\ \ In…
on “My 2019 Mathematics a to Z: Linear Programming” ↗