Skip to content

Latest commit

 

History

History
9 lines (5 loc) · 394 Bytes

README.md

File metadata and controls

9 lines (5 loc) · 394 Bytes

natural-computing

Graduate coursework in Natural Computing


This repository is almost entirely homework, with a slightly improved version of the in-class example of using Simulated Annealing to produce solutions for the Travelling Salesman Problem given here.

Each homework has a corresponding paper that can be built with the included makefile.