#8404: Computing a H-minor
----------------------------+-----------------------------------------------
Reporter: ncohen | Owner: rlm
Type: enhancement | Status: positive_review
Priority: major | Milestone: sage-4.3.4
Component: graph theory | Keywords:
Author: | Upstream: N/A
Reviewer: | Merged:
Work_issues: |
----------------------------+-----------------------------------------------
Changes (by dimpase):
* status: needs_review => positive_review
Comment:
Replying to [comment:20 ncohen]:
> now with *Mixed Integer* linear program
OK, but please also fix
{{{
ALGORITHM
Mixed Integer Linear Program
}}}
it must be "Programming", not "Program" here.
I also notice similar misuses of "Linear Program/Programming" (instead of
(M)ILP) on
http://www.sagemath.org/doc/reference/sage/numerical/mip.html
and another tutorial-like thing you wrote
(in the latter you also forget to mention that max. matching problem in a
graph
can be solved in polynomial time, using LP (or otherwise), so that the
MILP formulation is far from the best possible)
Please fix these too some time soon, please...
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/8404#comment:21>
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.
