glpk 3.2.1 release information

[Andrew Makhorin]

GLPK 3.2.1 -- Release Information
*********************************

Release date: Aug 12, 2002

GLPK (GNU Linear Programming Kit) is intended for solving large-scale
linear programming (LP), mixed integer linear programming (MIP), and
other related problems. It is a set of routines written in ANSI C and
organized in the form of a callable library.

Now GLPK includes a preliminary implementation of the branch-and-cut
framework, which is a set of data structures and routines intended for
developing branch-and-cut methods for solving mixed integer and
combinatorial optimization problems.

Detailed decsription of the branch-and-cut framework is given in the
document "GLPK: A Preliminary Implementation of the Branch-And-Cut
Framework" included in the distribution (see the file 'brcut.txt' in
the subdirectory 'doc').

In order to illustrate how the GLPK branch-and-cut framework can be
used for solving a particular optimization problem there is an example
included in the package. This is a stand-alone program, TSPSOL, which
is intended for solving to optimality the symmetric Traveling Salesman
Problem (TSP), a classical problem of the combinatorial optimization
(see the file 'tspsol.c' in the subdirectory 'sample').

Please note that the current version of GLPK is *tentative*.

See GLPK webpage at <http://www.gnu.org/software/glpk/glpk.html>.

GLPK distribution can be ftp'ed from <ftp://ftp.gnu.org/gnu/glpk/> or
from some mirror ftp sites; see <http://www.gnu.org/order/ftp.html>.

Checksum is the following:

440d5e25a3066a896ff1b3e1ac5251c5 *glpk-3.2.1.tar.gz

GLPK is also available as a Debian GNU/Linux package. See the webpage
at <http://packages.debian.org/stable/math/glpk.html>.