Shop the Archives and get your next eBook for just 14.99! Stock up today >>

Mathematical Programming Studies

Netflow at Pisa

Editors: Gallo, Giorgio, Sandi, C. (Eds.)

Buy this book

eBook  
  • ISBN 978-3-642-00923-5
  • Digitally watermarked, DRM-free
  • Included format:
  • ebooks can be used on all reading devices

Table of contents (24 chapters)

  • Algorithms for maximum network flow

    Tarjan, Robert E.

    Pages 1-11

    Preview Buy Chapter price n/a
  • Threshold assignment algorithm

    Glover, Fred (et al.)

    Pages 12-37

    Preview Buy Chapter price n/a
  • Shortest path methods: A unifying approach

    Gallo, Giorgio (et al.)

    Pages 38-64

    Preview Buy Chapter price n/a
  • On a nonbasic dual method for the transportation problem

    Sandi, Claudio

    Pages 65-82

    Preview Buy Chapter price n/a
  • An efficient implementation of the network simplex method

    Grigoriadis, M. D.

    Pages 83-111

    Preview Buy Chapter price n/a

Buy this book

eBook  
  • ISBN 978-3-642-00923-5
  • Digitally watermarked, DRM-free
  • Included format:
  • ebooks can be used on all reading devices
Loading...

Recommended for you

Loading...

Bibliographic Information

Bibliographic Information
Book Title
Netflow at Pisa
Editors
  • Giorgio Gallo
  • C. Sandi
Series Title
Mathematical Programming Studies
Series Volume
26
Copyright
1986
Publisher
Springer-Verlag Berlin Heidelberg
Copyright Holder
Springer-Verlag Berlin Heidelberg
eBook ISBN
978-3-642-00923-5
DOI
10.1007/BFb0121084
Series ISSN
0303-3929
Edition Number
1
Number of Pages
256
Topics