#13698: Access to graph routines of the GLPK
------------------------------+---------------------------------------------
Reporter: christiankuper | Owner: jason, jkantor
Type: enhancement | Status: new
Priority: major | Milestone: sage-5.5
Component: numerical | Keywords: out-of-kilter, minflow,
maxflow, critical path, GLPK
Work issues: | Report Upstream: N/A
Reviewers: | Authors: Christian Kuper
Merged in: | Dependencies:
Stopgaps: |
------------------------------+---------------------------------------------
Certain types of linear problems can be more efficiently solved with
algorithms more specialized than the simplex algorithm. An example of such
problems is a mincost problem. The GLPK provides a set of graph / network
algorithms which currently have got not interface to Sage.
This patch implements a new backend intended to provide access to the GLPK
graph / network routines. The initial implementation should provide an
interface to
* glp_mincost_okalg - Solving mincost problems with the out-of-kilter
algorithm
* glp_maxflow_ffalg - Solving maxflow problems with the Ford-Fulkerson
algorithm
* glp_cpp - Solving critical path problems
In addition it provides support for reading and writing problem data to
files
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/13698>
Sage <http://www.sagemath.org>
Sage: Creating a Viable Open Source Alternative to Magma, Maple, Mathematica,
and MATLAB
--
You received this message because you are subscribed to the Google Groups
"sage-trac" group.
To post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/sage-trac?hl=en.
