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
Click to download this file (397kB) Preview	Preview
This file may not be suitable for users of assistive technology. Request an accessible format
PDF Language: English
Click to download this file (311kB) Preview	Preview
This file may not be suitable for users 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:	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:	16 Nov 2021 09:52 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

Depositors only (login required):

Download Statistics

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