//-->
On the complexity of Convex Hull Algorithms if rotational minima can be found very fast
Huckenbeck, Ulrich, (1988)
The cut search algorithm with arc capacities and lower bounds
Phillips, Steve, (1979)
An O [/E/] time algorithm computing the reliability of a class of directed networks
Agrawal, Avinash, (1984)
Reoptimization procedures for bounded variable primal simplex network algorithms
Ali, A. Iqbal, (1986)
The m-travelling salesmen problem
Ali, A. Iqbal, (1980)