Refine
Year of publication
- 1999 (1)
Document Type
- Preprint (1)
Language
- English (1) (remove)
Has Fulltext
- yes (1)
Keywords
- Approximation Algorithms (1) (remove)
Faculty / Organisational entity
The computational complexity of combinatorial multiple objective programming problems is investigated. NP-completeness and #P-completeness results are presented. Using two definitions of approximability, general results are presented, which outline limits for approximation algorithms. The performance of the well known tree and Christofides' heuristics for the TSP is investigated in the multicriteria case with respect to the two definitions of approximability.