Boiten, Eerke Albert (2004) Travelling Salesman Heuristics: Exercises in Haskell. Technical report. University of Kent (KAR id:14138)
|
Postscript
Language: English |
||
|
Download (397kB)
Preview
|
|
|
|
This file may not be suitable for user of assistive technology. Request an accessible format. |
||
|
PDF
Language: English |
||
|
Download (311kB)
Preview
|
|
|
|
This file may not be suitable for user of assistive technology. Request an accessible format. |
||
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.
| Item Type: | Monograph (Technical report) |
|---|---|
| Uncontrolled keywords: | teaching functional programming, Haskell, TSP |
| Subjects: | Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming, |
| Divisions: | Faculties > Sciences > School of Computing > Theoretical Computing Group |
| Depositing User: | Eerke Boiten |
| Date Deposited: | 24 Nov 2008 18:02 UTC |
| Last Modified: | 28 May 2019 13:51 UTC |
| Resource URI: | https://kar.kent.ac.uk/id/eprint/14138 (The current URI for this page, for reference purposes) |
| Boiten, Eerke Albert: |  https://orcid.org/0000-0002-9184-8968 |
- Export to:
- RefWorks
- EPrints3 XML
- BibTeX
- CSV
- Depositors only (login required):
Download Statistics
Download Statistics