Category: Information
-
A Traveling Salesman Problem Example
Let’s say that you are trying to solve the traveling salesman problem. Let us compare two particular approaches: Random and Greedy. We will use a small subset of New York cities (NYC, Rochester, Albany, Syracuse). Random Algorithm: 1. Pick a random starting city from (NYC, Rochester, Albany, Syracuse). Let us start with Rochester. Chosen Cities…
-
My Moog Voyager XL
-
Hello, world
Well, I decided to restart the website. First because it would be slightly cheaper to run, second because I was interested in rebooting this enterprise, like in the way you do a fresh install of Windows. So what will be different? Well, I think it will be focused a bit more focused and concentrated on…