>> Does any of you know if there is a free >> library that implements a solver for >> the transportation problem? > > The transportation problem is a particular case of the minimum cost > flow problem, which can be solved either with the standard simplex or > with a specialized algorithm like the network simplex. Currently glpk > includes the api routine glp_mincost_okalg that implements the > out-of-kilter algorithm. For more details see the document "Graph and > Network Routines" (doc/graphs.pdf) included in the glpk distribution.
See also the following page: http://people.brunel.ac.uk/~mastjjb/jeb/or/netflow.html _______________________________________________ Help-glpk mailing list [email protected] http://lists.gnu.org/mailman/listinfo/help-glpk
