#12027: Adding Functionality to the multicommodity_flow() function
----------------------------+-----------------------------------------------
Reporter: yairzick | Owner: jason, ncohen, rlm
Type: enhancement | Status: new
Priority: major | Milestone: sage-4.8
Component: graph theory | Keywords: graph theory, multicommodity flow
Work_issues: | Upstream: N/A
Reviewer: | Author:
Merged: | Dependencies:
----------------------------+-----------------------------------------------
Hi,
The multicommodity flow (mcf) problem has other variants that are
important as well - e.g. the maximum concurrent flow problem (which
generalizes the maximum multicommodity flow problem) see
[http://en.wikipedia.org/wiki/Multi-commodity_flow_problem]. Currently,
the only mcf problem variant implemented is the demand satisfaction mcf
problem. Is it possible to implement the others as well? for the maximum
concurrent flow, which is the one I care about, it just means changing an
equality to an inequality in the LP.
Thanks,
Yair Zick
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/12027>
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.
