Domination analysis of combinatorial optimization problems
- 1 August 2003
- journal article
- research article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 129 (2-3) , 513-520
- https://doi.org/10.1016/s0166-218x(03)00359-7
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Exponential Neighborhoods and Domination Analysis for the TSPPublished by Springer Nature ,2007
- Transformations of generalized ATSP into ATSPOperations Research Letters, 2003
- TSP Heuristics: Domination Analysis and ComplexityAlgorithmica, 2003
- Domination analysis of some heuristics for the traveling salesman problemDiscrete Applied Mathematics, 2002
- Polynomial approximation algorithms for the TSP and the QAP with a factorial domination numberDiscrete Applied Mathematics, 2002
- Traveling salesman should not be greedy: domination analysis of greedy-type heuristics for the TSPDiscrete Applied Mathematics, 2002
- z-ApproximationsJournal of Algorithms, 2001
- Clique is hard to approximate within n1−εActa Mathematica, 1999
- The travelling salesman problem: new solvable cases and linkages with the development of approximation algorithmsJournal of the Operational Research Society, 1997
- The approximation of maximum subgraph problemsPublished by Springer Nature ,1993