Multiobjective Traveling Salesman Problems and Redundancy of Complete Sets
The first part of this thesis deals with the approximability of the traveling salesman problem. This problem is defined on a complete graph with edge weights, and the task is to find a Hamiltonian cycle of minimum weight that visits each vertex exactly once. We study the most important multiobjectiv...
| Main Author: | |
|---|---|
| Format: | Doctoral Thesis |
| Language: | English |
| Published: |
2014
|
| Subjects: | |
| Online Access: | https://opus.bibliothek.uni-wuerzburg.de/frontdoor/index/index/docId/11074 http://nbn-resolving.de/urn:nbn:de:bvb:20-opus-110740 https://nbn-resolving.org/urn:nbn:de:bvb:20-opus-110740 https://opus.bibliothek.uni-wuerzburg.de/files/11074/witek_maximilian_dissertation.pdf |