The transportation problem and cycle cancelling methods are classical in optimization.
The usual attributions are to the 1940's and later2. However, as early as 1930, A.N. Tolsto
[1930]3 published, in a book on transportation planning issued by the National Commissariat
of Transportation of the Soviet Union, an article called Methods of nding the minimal total
kilometrage in cargo-transportation planning in space, in which he studied the transportation
problem and described a number of solution approaches, including the, now well-known,
idea that an optimum solution does not have any negative-cost cycle in its residual graph4.
He might have been the rst to observe that the cycle condition is necessary for optimality.
Moreover, he assumed, but did not explicitly state or prove, the fact that checking the cycle
condition is also sucient for optimality
The transportation problem and cycle cancelling methods are classical in optimization.
The usual attributions are to the 1940's and later2. However, as early as 1930, A.N. Tolsto
[1930]3 published, in a book on transportation planning issued by the National Commissariat
of Transportation of the Soviet Union, an article called Methods of nding the minimal total
kilometrage in cargo-transportation planning in space, in which he studied the transportation
problem and described a number of solution approaches, including the, now well-known,
idea that an optimum solution does not have any negative-cost cycle in its residual graph4.
He might have been the rst to observe that the cycle condition is necessary for optimality.
Moreover, he assumed, but did not explicitly state or prove, the fact that checking the cycle
condition is also sucient for optimality
การแปล กรุณารอสักครู่..