Corpus ID: 227888658

On the history of the transportation and maximum flow problems

@article{SchrijverAlexander2002OnTH,
  title={On the history of the transportation and maximum flow problems},
  author={SchrijverAlexander},
  journal={Mathematical Programming},
  year={2002}
}
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 cycl... 
4 Citations
On the history of the transportation and maximum flow problems
TLDR
Two papers of historical interest for combinatorial optimization are reviewed: an article of A.N. Tolsto&ıbreve from 1930, in which the transportation problem is studied, and a negative cycle criterion is developed and applied to solve a large-scale transportation problem to optimality. Expand
A parallel approach for obtaining maximum flow in a network
  • D. Joseph, S. Shine
  • Computer Science
  • 2015 International Conference on Control Communication & Computing India (ICCC)
  • 2015
TLDR
A parallel approach for obtaining maximum flow in a network is presented here and the concept of layered network is used here. Expand
Geometric quadrisection in linear time, with application to VLSI placement
  • J. Vygen
  • Computer Science, Mathematics
  • Discret. Optim.
  • 2005
TLDR
A linear-time algorithm based on a structure theorem describing optimal solutions by so-called ''American maps'' and makes sophisticated use of binary search techniques and weighted median computations to solve the fractional relaxation of VLSI placement. Expand
Analytical Model and Topology Evaluation of Quantum Secure Communication Network
TLDR
A flow-based mathematical model is proposed to describe a QKD network using mathematical concepts and language and a large number of simulation results validate the effectiveness of the proposed model and indicator. Expand