A Simple TSP-Solver: An ABACUS Tutorial

Thienel, Stefan (1996) A Simple TSP-Solver: An ABACUS Tutorial.
Technical Report , 34 p.

Abstract

This CWEB program shows how a branch-and-cut algorithm for the traveling salesman problem (TSP) can be implemented with the software framework ABACUS. The intention of this program is not the practically efficient solution of TSPs but to show basic and some advanced features of ABACUS.


Actions:
Download: [img] Postscript
Download (401kB)
Editorial actions: View Item View Item (Login required)
Deposit Information:
ZAIK Number: zpr96-245
Depositing User: Archive Admin
Date Deposited: 02 Apr 2001 00:00
Last Modified: 17 Oct 2011 11:55
URI: http://e-archive.informatik.uni-koeln.de/id/eprint/245