© University of Kent - Contact | Feedback | Legal | FOI | Cookies
Travelling salesman heuristics: Exercises in Haskell
Eerke Boiten
Technical Report 10-04, University of Kent, Computing Laboratory, June 2004.Abstract
This document contains a collection of programming exercises in the functional programming language Haskell. The exercises are all concerned with the infamous Travelling Salesman Problem (TSP for short), both its exact solution and heuristic approximations. Download publication 387 kbytes (PostScript)Bibtex Record
@techreport{1923,
author = {Eerke Boiten},
title = {Travelling Salesman Heuristics: Exercises in {H}askell},
month = {June},
year = {2004},
pages = {182-196},
keywords = {determinacy analysis, Craig interpolants},
note = {},
doi = {},
url = {http://www.cs.kent.ac.uk/pubs/2004/1923},
publication_type = {techreport},
submission_id = {29993_1086264834},
type = {Technical Report},
number = {10-04},
institution = {University of Kent, Computing Laboratory},
}