-
Instead of just trusting that the output of a polyhedral algorithm (e.g., polyhedral representation conversion) is correct, we make them verifiable.
- The verification should be written in plain Py…
-
Hi everyone! I've just started to use GLOP in python and I've a question because I can't find the answer trough the help command or on the net. Does GLOP by default implemet the simplex method or any …
-
**Describe the solution you'd like**
I'd like to be able to do a multiparametric optimisation, ideally using the nelder-mead algorithm,as in scipy https://docs.scipy.org/doc/scipy/reference/optimize.…
-
Hi,
I played around with your Linear.Grammar package and
also tried to solve some linear programs with Linear.Simplex.Primal.
It seems like either I'm doing something completely wrong or there is
a …
-
Hi! I'm doing some ~10--20 dimensional parameter optimization for an astrophysical model and came across your package whilst researching efficient algorithms. My model takes ~2 mins to run for each …
-
Hi,
I am loading my own point cloud file (xyz format) and calculating the triangulation. I need the triangle faces created by the algorithm, but I can get only a simplex i.e. a tetra. I tried to use …
-
Our current `SimplicialComplex` class has static functions that return sets of simplices as `SimplicialComplex` objects even though the sets of simplices do not form a simplicial complex. Its current …
-
Right now our map is generated exclusively with Unity's built-in Perlin noise. Perlin is pretty slow, compared to other coherent noise algorithms such as Simplex noise, and isn't really extensible.
I…
-
There are several solvers in cuML which can benefit algorithm development across the larger RAPIDS ecosystem by living in RAFT. For example, there is interest in exposing some of the solvers from RAFT…
-
Solving ILP is NP-Hard and the paper presented uses a method of [branch-and-cut](http://en.wikipedia.org/wiki/Branch_and_cut) but the wiki is fairly dense. Does anyone have an intuitive explanation? f…