Search result - Books - CeDe.ch

Your contact at CeDe

Any questions, tips, praise or criticism? Your feedback helps us to make CeDe.ch even better. That's why we are pleased to receive every message and answer all our emails quickly, competently and willingly. Thank you!

This site uses cookies. Read our privacy policy to learn more about how we use cookies and how you can change your preferences. OK

Top service and free shipping since 1997

Search result

Lester Randolph Ford, Lester Randolph Fulkerson Ford, Ford Lester Randolph, D. R. Fulkerson, Fulkerson D. R. - Flows in Networks

Lester Randolph Ford, Lester Randolph Fulkerson Ford, Ford Lester Randolph, D. R. Fulkerson, Fulkerson D. R. Flows in Networks English 03.12.2024 Paperback / Softback Fr. 60.50 1-3 weeks (not available at short notice)

L. Ford, L. R. Ford, L. R. Fulkerson Ford, L.r. Fulkerson Ford, Lester Randolph Ford, Lester Randolph Fulkerson Ford... - Flows in Networks

L. Ford, L. R. Ford, L. R. Fulkerson Ford, L.r. Fulkerson Ford, Lester Randolph Ford, Lester Randolph Fulkerson Ford... Flows in Networks English 31.10.2010 Paperback / Softback Fr. 54.50 1-3 weeks (not available at short notice)

Ravindra Ahuja, Ravindra K. Ahuja, Thomas Magnanti, Thomas L. Magnanti, James Orlin, James B. Orlin - Network Flows

Ravindra Ahuja, Ravindra K. Ahuja, Thomas Magnanti, Thomas L. Magnanti, James Orlin, James B. Orlin Network Flows English 01.11.2013 Paperback / Softback Fr. 103.70 3-5 weeks

James B. Orlin - Genuinely Polynominal Simplex and Non-Simplex Algorithms for the Minimum Cost Flow Problem (Classic Reprint)

James B. Orlin Genuinely Polynominal Simplex and Non-Simplex Algorithms for the Minimum Cost Flow Problem (Classic Reprint) English 01.01.2017 Hardback Fr. 46.70 2-3 weeks (title will be printed to order)

James B. Orlin, Sloan School of Management - Genuinely Polynomial Simplex and Non-Simplex Algorithms for the Minimum Cost Flow Problem

James B. Orlin, Sloan School of Management Genuinely Polynomial Simplex and Non-Simplex Algorithms for the Minimum Cost Flow Problem English 01.01.2015 Hardback Fr. 41.40 3-5 weeks (title will be specially ordered)

r k magnanti Ahuja, Ravindra K. Ahuja, Thomas L. Magnanti, Thomas L. Magnati, James B. Orlin - Network flows

r k magnanti Ahuja, Ravindra K. Ahuja, Thomas L. Magnanti, Thomas L. Magnati, James B. Orlin Network flows English 18.02.1993 Hardback Sold out

James B. Orlin - Polynomial Dual Network Simplex Algorithms (Classic Reprint)

James B. Orlin Polynomial Dual Network Simplex Algorithms (Classic Reprint) English 01.01.2018 Hardback Sold out

James B. Orlin - Genuinely Polynominal Simplex and Non-Simplex Algorithms for the Minimum Cost Flow Problem (Classic Reprint)

James B. Orlin Genuinely Polynominal Simplex and Non-Simplex Algorithms for the Minimum Cost Flow Problem (Classic Reprint) English 01.01.2017 Hardback Sold out

James B. Orlin - Genuinely Polynominal Simplex and Non-Simplex Algorithms for the Minimum Cost Flow Problem (Classic Reprint)

James B. Orlin Genuinely Polynominal Simplex and Non-Simplex Algorithms for the Minimum Cost Flow Problem (Classic Reprint) English 01.01.2016 Paperback / Softback Sold out

James B. Orlin - Polynomial Dual Network Simplex Algorithms (Classic Reprint)

James B. Orlin Polynomial Dual Network Simplex Algorithms (Classic Reprint) English 31.08.2015 Paperback / Softback Sold out