Skip to content

Latest commit

 

History

History
25 lines (16 loc) · 612 Bytes

README.md

File metadata and controls

25 lines (16 loc) · 612 Bytes

Airline TSP

An example of using Gurobi to compute a minimal weight Hamiltonian cycle (Traveling Salesman Problem)

Running the example

  1. Start Python's webserver from the command line

    make
    
  2. Point your browser at http://localhost:8000

  3. Add some nodes with by clicking your mouse in the demo area.

  4. Click "Compute Tour" to find the minimal weight tour.

Sources

The d3 code for the map is based on Mike Bostock's "Let's Make a Map" block.