#13698: Access to graph routines of the GLPK
------------------------------------------------------------------------+---
Reporter: christiankuper |
Owner: jason, jkantor
Type: enhancement |
Status: needs_info
Priority: major |
Milestone: sage-5.8
Component: numerical |
Resolution:
Keywords: out-of-kilter, minflow, maxflow, critical path, GLPK |
Work issues:
Report Upstream: N/A |
Reviewers:
Authors: Christian Kuper |
Merged in:
Dependencies: |
Stopgaps:
------------------------------------------------------------------------+---
Changes (by christiankuper):
* status: needs_work => needs_info
Old description:
> 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
>
> Apply :
> * [attachment:trac_13698_glpk_graph_routv2.patch]
> * [attachment:trac_13698-rev.2.patch]
New description:
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
Apply :
* [attachment:trac_13698_glpk_graph_routv2.patch]
* [attachment:trac_13698-rev.patch]
* [attachment:trac_13698-rev2.patch]
--
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/13698#comment:30>
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 unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To post to this group, send email to [email protected].
Visit this group at http://groups.google.com/group/sage-trac?hl=en.
For more options, visit https://groups.google.com/groups/opt_out.
