#16391: Helper functions for OA constructions
-------------------------------------+-------------------------------------
Reporter: ncohen | Owner:
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-6.3
Component: combinatorial | Resolution:
designs | Merged in:
Keywords: | Reviewers:
Authors: Nathann Cohen | Work issues:
Report Upstream: N/A | Commit:
Branch: u/ncohen/16391 | 90f828fb2904fc5083baa8b45af97d6dc7740f54
Dependencies: #16370 | Stopgaps:
-------------------------------------+-------------------------------------
Comment (by ncohen):
Hello !
Here is the updated code.
As it is the feature "give me the maximum number of disjoint blocks" is
not available, but it can be easily added later. This being said if we do
that perhaps the best algorithm to use is not the LP solver but rather
`graphs.OrthogonalArrayBlockGraph(k,n).independent_set(algorithm=something)`.
And it seems that the best something, even though it is an optional
package at the moment, may be MCQD #16083.
Ready for review again !
Nathann
--
Ticket URL: <http://trac.sagemath.org/ticket/16391#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.
