Travelling Salesman Heuristics: Exercises in Haskell

Boiten, Eerke Albert (2004) Travelling Salesman Heuristics: Exercises in Haskell. Technical report. University of Kent (KAR id:14138)

Postscript Language: English
Download this file (Postscript/397kB)	Preview
Request a format suitable for use with assistive technology e.g. a screenreader
PDF Language: English
Download this file (PDF/311kB)	Preview
Request a format suitable for use with assistive technology e.g. a screenreader

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:	Reports and Papers (Technical report)
Uncontrolled keywords:	teaching functional programming, Haskell, TSP
Subjects:	Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions:	Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing
Depositing User:	Eerke Boiten
Date Deposited:	24 Nov 2008 18:02 UTC
Last Modified:	05 Nov 2024 09:48 UTC
Resource URI:	https://kar.kent.ac.uk/id/eprint/14138 (The current URI for this page, for reference purposes)

University of Kent Author Information

Boiten, Eerke Albert.

Creator's ORCID:	https://orcid.org/0000-0002-9184-8968
CReDIT Contributor Roles:

Depositors only (login required):

Download Statistics

Total unique views for this document in KAR since July 2020. For more details click on the image.