[Top][All Lists]
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: HA: [Help-glpk] transportation problem
From: |
Andrew Makhorin |
Subject: |
Re: HA: [Help-glpk] transportation problem |
Date: |
Mon, 31 May 2010 19:57:16 +0400 |
> Below is a pointer to the Andrew Goldberg #39;s Network
> Optimization Library, CS2 in the library is an extremely fast routine
> to solve min. cost flow and therefore the "transportation" problem,
> and has been built into at least one proprietary transportation
> planner. You can #39;t just embed the CS2 routine in GLPK. It has
> totally different data structures and it makes use of pointer
> artithmic in a specific way.
> http://www.avglab.com/andrew/soft.html
>
> It is not free software! There are copyright rules to be obeyed.
A free alternative is the RELAX-IV code developed by Prof. Dimitri
Bertsekas; see http://web.mit.edu/dimitrib/www/RELAX4_doc.pdf and
http://elib.zib.de/pub/Packages/mathprog/mincost/relax-4/ . It is
also extremely fast code.