• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

DMCA

On the History of the Transportation and Maximum Flow Problems

Cached

  • Download as a PDF

Download Links

  • [www.cwi.nl]
  • [emis.maths.adelaide.edu.au]
  • [www.emis.de]
  • [www.maths.soton.ac.uk]
  • [www.math.uni-bielefeld.de]
  • [www.univie.ac.at]
  • [www.mathematik.uni-bielefeld.de]
  • [www.mat.ub.edu]
  • [www.math.uni-bielefeld.de]
  • [www.cwi.nl]
  • [www.ibr.cs.tu-bs.de]
  • [homepages.cwi.nl]
  • [www.di.uoa.gr]

  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Alexander Schrijver
Citations:21 - 0 self
  • Summary
  • Citations
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@MISC{Schrijver_onthe,
    author = {Alexander Schrijver},
    title = {On the History of the Transportation and Maximum Flow Problems},
    year = {}
}

Share

Facebook Twitter Reddit Bibsonomy

OpenURL

 

Abstract

We review two papers that are of historical interest for combinatorial optimization: an article of A.N. Tolstoi from 1930, in which the transportation problem is studied, and a negative cycle criterion is developed and applied to solve a (for that time) large-scale (10 \Theta 68) transportation problem to optimality; and an, until recently secret, RAND report of T.E. Harris and F.S. Ross from 1955, that Ford and Fulkerson mention as motivation to study the maximum flow problem. The papers have in common that they both apply their methods to the Soviet railway network.

Keyphrases

maximum flow problem    transportation problem    t.e. harris    historical interest    rand report    a.n. tolstoi    combinatorial optimization    soviet railway network    fulkerson mention    negative cycle criterion    f.s. ross   

Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University