Thienel, Stefan
(1996).
A Simple TSP-Solver: An ABACUS Tutorial.
Working Paper.
|
PDF
zpr96-245.pdf Download (248kB) | Preview |
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.
| Item Type: | Preprints, Working Papers or Reports (Working Paper) | ||||||||
| Creators: |
|
||||||||
| URN: | urn:nbn:de:hbz:38-547669 | ||||||||
| Date: | 1996 | ||||||||
| Language: | English | ||||||||
| Faculty: | Faculty of Mathematics and Natural Sciences | ||||||||
| Divisions: | Faculty of Mathematics and Natural Sciences > Department of Mathematics and Computer Science > Institute of Computer Science | ||||||||
| Subjects: | Data processing Computer science | ||||||||
| Refereed: | No | ||||||||
| URI: | http://kups.ub.uni-koeln.de/id/eprint/54766 |
Downloads
Downloads per month over past year
Export
Actions (login required)
 |
View Item |