🚀 go-pugleaf

In article <1992Oct14.232927.24873@m.cs.uiuc.edu> joshi@m.cs.uiuc.edu (Anil Joshi) writes:
>Try getting the code from netlib@ornl.com (I think the address is
>right). There are also a couple of public domain ones, 

I couldn't find this site; this isn't the famous netlib -
research.att.com.  I couldn't find anything quite relevant there.  (If
I was just not looking in the right directory, I'd love to be
corrected.  It's always more useful to be given both the site name,
and some reasonable pointer to a relevant subdirectory.)

>one is called netflo written by Kennington and Helagason at Southern
>Methodist Univ and the other is called Relax III written by
>Bertsekas. I have implemented an Interior point path following version
>(algo by PM Vaidya) which is better than netflo and relax III only
>for very large problem sizes (# edges=>128,000) but hogs a lot more
>memory than the other two I mentioned.

Netflo, by Kennington & Helgason, is available at dimacs.rutgers.edu,
in the directory /pub/netflow/mincost/solver1.

I haven't been able to find a source for Relax III thus far.  Does
anyone have any pointers to it?

-- 
Christopher Browne                |     PGP 2.0 key available
cbbrowne@csi.uottawa.ca           | <-- Finger this account
University of Ottawa              |
Master of System Science Program  |