A MATLAB transportation problem solver based on CS2 v4.3 implementation [1]
of Goldberg-Tarjan's min-cost network flow algorithm [2]. The included version
of CS2 has been slightly modified, but remains close to the original and, hence,
is covered by the original CS2 license.

When you run gt_transport for the first time, it ask that you agree to the CS2
license. When you have agreed, a file cs2-4.3/COPYRIGHT-agreed.txt gets generated,
that prevents the license agreement request from popping up again. It may make
sense to keep this file in the deployment version; alternatively, you would need
to run the code interactively at least once on your server/cluster, in order to
agree to the license.

For a usage example, see usage_example.m.

Victor Amelkin <victor@cs.ucsb.edu>

REFERENCES:

	[1] Goldberg, Andrew, and Robert Tarjan. "Solving minimum-cost flow problems
		by successive approximation." Proceedings of the nineteenth annual ACM
		symposium on Theory of computing. ACM, 1987.

	[2] Goldberg, Andrew V. "An efficient implementation of a scaling minimum-cost
		flow algorithm." Journal of algorithms 22.1 (1997): 1-29.