Major improvements in NetworkSimplex.
Main changes:
- Use -potenital[] instead of potential[] to conform to the usual
terminology.
- Use function parameter instead of #define commands to select pivot rule.
- Use much faster implementation for the candidate list pivot rule.
It is about 5-20 times faster now.
- Add a new pivot rule called "Limited Search" that is a modified
version of "Block Search". It is about 25 percent faster on rather
sparse graphs.
- By default "Limited Search" is used for sparse graphs and
"Block Search" is used otherwise. This combined method is the most
efficient on every input class.
- Change the name of private members to start with "_".
- Change the name of function parameters not to start with "_".
- Remove unnecessary documentation for private members.
- Many doc improvements.
7 echo "Usage: autopackage-glpk tarfile"
13 VERSION=`echo ${ORIGTAR/.tar.gz}|tr - ' '|awk '{print $(NF)}'`
15 echo "GLPK VERSION: $VERSION"
16 echo " RELEASE: $RELEASE"
21 function make-dir () {
31 echo '# -*-shell-script-*-
34 RootName: @lemon.cs.elte.hu/lemon:$SOFTWAREVERSION
37 Maintainer: The LEMON Developers - http://lemon.cs.elte.hu/
38 Packager: Alpar Juttner <alpar@cs.elte.hu>
39 Summary: GLPK LP/MIP solver
41 SoftwareVersion: '${VERSION}'
42 AutopackageTarget: 1.2
44 # Only uncomment InterfaceVersion if your package exposes interfaces to other software,
45 # for instance if it includes DSOs or python/perl modules. See the developer guide for more info,
46 # or ask on autopackage-dev if you dont understand interface versioning in autopackage.
48 InterfaceVersion: '${VERSION}'
53 The GLPK package is a set of routines written in ANSI C and organized
54 in the form of a callable library. This package is intended for solving
55 large-scale linear programming (LP), mixed integer linear programming
56 (MIP), and other related problems.
58 The GLPK package includes the following main components:
60 * implementation of the simplex method;
61 * implementation of the primal-dual interior-point method;
62 * implementation of the branch-and-bound method;
63 * application program interface (API);
64 * GNU MathProg modeling language (a subset of AMPL);
65 * GLPSOL, a stand-alone LP/MIP solver.
67 See GLPK webpage <http://www.gnu.org/software/glpk/glpk.html>.
80 #require @whatever.you/need 1.0
83 # Put your installation script here
88 # Usually just the following line is enough to uninstall everything
90 '>autopackage/default.apspec
94 cp *.package *.meta ..
97 rm -rf glpk-${VERSION}