From - Thu Feb 6 01:48:28 1997 Path: Radon.Stanford.EDU!news.Stanford.EDU!su-news-hub1.bbnplanet.com!news.bbnplanet.com!cpk-news-hub1.bbnplanet.com!newsserver.jvnc.net!newsserver.nj.nec.com!newsserver.nj.nec.com!avg From: avg@squaw.nj.nec.com (Andrew Goldberg) Newsgroups: comp.theory Subject: Optimization software available Followup-To: comp.theory Date: 05 Feb 1997 23:42:19 GMT Organization: NEC Research Institute Lines: 47 Distribution: world Message-ID:NNTP-Posting-Host: squaw.nj.nec.com The following software is available via my home page, URL http://www.neci.nj.nec.com/homepages/avg.html (My recent Technical Reports and some of my older papers are also available.) NOTE: these codes are available free for non-commercial use only. Commercial use of some codes requires a license. New software (hot priority queues, negative cycle detection, minimum cuts) will be available in a few weeks. SPLIB: codes, generators, and generator inputs for shortest path algorithms. SPLIB was developed by Boris Cherkassky, Andrew Goldberg, and Tomasz Radzik. For a detailed description and experimental data, see "Shortest Paths Algorithms: Theory and Experimental Evaluation," by B.V. Cherkassky, A.V. Goldberg, and T. Radzik, Math. Prog. 73 (1996), pages 129--174. CSA: an efficient implementation of a scaling push-relabel algorithm for the assignment problem. CSA was developed by Andrew Goldberg and Robert Kennedy. For a detailed description and experimental data, see "An Efficient Cost Scaling Algorithm for the Assignment Problem," by A.V. Goldberg and R. Kennedy, Math. Prog. 71 (1995), pages 153--178. CS2: an efficient implementation of a scaling push-relabel algorithm for the minimum-cost flow/transportation problems. CS2 was developed by Boris Cherkassky and Andrew Goldberg. For a detailed description and experimental data, see "An Efficient Implementation of a Scaling Minimum-Cost Flow Algorithm", by A.V. Goldberg, J. Algorithms 22 (1997), pages 1--29. PRF: an efficient implementations the push-relabel method for the maximum flow/minimum cut problems. PRF was developed by Boris Cherkassky and Andrew Goldberg. For a detailed description and experimental data, see "On Implementing Push-Relabel Method for the Maximum Flow Problem," by B.V. Cherkassky and A.V. Goldberg, Proc. 4th IPCO Conf., Springer Lecture Notes in CS 920 (1995), pages 157--171. -- Andrew V. Goldberg NEC Research Institute (609) 951-2727 4 Independence Way (609) 951-2488 (fax) Princeton, NJ 08540 URL: http://www.neci.nj.nec.com/homepages/avg.html