#16714: Add a matrix of constraints in a LP
-------------------------------------+-------------------------------------
Reporter: ncohen | Owner:
Type: enhancement | Status: new
Priority: major | Milestone: sage-6.3
Component: linear | Resolution:
programming | Merged in:
Keywords: | Reviewers:
Authors: | Work issues:
Report Upstream: N/A | Commit:
Branch: | 846cba629c68e46f274de8d6cbbaabd3cdbb0a99
u/vbraun/add_a_matrix_of_constraints_in_a_lp| Stopgaps:
Dependencies: |
-------------------------------------+-------------------------------------
Comment (by dimpase):
Replying to [comment:16 ncohen]:
> > Come on, it is implemented e.g. here:
[http://networkx.github.io/documentation/latest/reference/generated/networkx.algorithms.matching.maximal_matching.html#networkx.algorithms.matching.maximal_matching
networkx]
>
> No, that is Edmond's algorith for general graphs (it is not bipartite-
specific) and it is also the default algorithm called by `Graph.matching`
in case. Plus it's pure Python.
>
Edmonds' on bipartite graphs will do more or less the same amount of work
as the Hungarian on bipartite graphs. Trust me, I taught these things few
times, I used to know details, and even implemented Hungarian method in C
and in Python :-)
Although Hungarian isn't the fastest guy in town.
PS. It is common (to the combinatorial optimisation community) knowledge
that LP-based methods hopelessly lose here. I don't make baseless claims
here, I know well what I am talking about...
--
Ticket URL: <http://trac.sagemath.org/ticket/16714#comment:17>
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.
For more options, visit https://groups.google.com/d/optout.
