-
Now that ZXY is in the wild, people will start to really "need" this tool. I don't think it's feasible to have previous versions working, but I wouldn't mind having a developer/staging branch and a st…
-
```
src/sage/combinat/designs/orthogonal_arrays.py:1446: p = MixedIntegerLinearProgram()
src/sage/combinat/designs/orthogonal_arrays_build_recursive.py:365: p = MixedIntegerLinearProgram()
sr…
-
One group of students implemented a TSP VectorOptimizer.
At the moment, it is based on scpsolver.
We all know that TSP is a hard problem and that the optimisation will need resources and a lot of com…
-
Try to solve one of the test cases in `benchmarks/cd1`
The solution should be optimal (use an optimal algorithm)
~~Maybe we can allow a near-optimal solution for a large benchmark, instead of an o…
-
@MrDupin There is no visualization anywhere for **simulated annealing** and **genetic algorithms** which can be demonstrated on Traveling Salesman Problem. I would like to work on it.
-
Hi!
I'm looking at this piece of code:
```js
Agent.prototype.live = function () { // Example: Live function
for (let i = 0; i < this.dna.length; i++) {
if (this.dna[i] === evolve…
-
Hi,
I am very new to DEAP, but I am researching on shortest path problem with multi mode transportation. I have designed a network. each node might link to multiple nodes, and for each link, might …
-
Hello,
My name is Iro Kafetzaki and I'm studying in the third year at the Athens University of Economics and Business in the Department of Management Science and Technology. In terms of a lesson …
-
They are three scheduling paths:
- Full hexagon
- Hexagon except empty areas
- spawn teleporting (broken now)
To patrol across rivers, linear paths are an interesting alternative to hexagons.…
-
There's currently no assurance of any optional tests, no matter whether they're commented or behind conditional compilation. Should that change