Dominance guarantees for above-average solutions
type: Item
instance of: scholarly article
title: Dominance guarantees for above-average solutions
zbMATH Open document ID: 1140.90482
author: Yochai Twitto
published in: Discrete Optimization
publication date: 2008-08-15T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 5312360
zbMATH Keywords: combinatorial optimization
zbMATH Keywords: approximation algorithms
zbMATH Keywords: analysis of algorithms
zbMATH Keywords: domination analysis
MaRDI profile type: Publication
full work available at URL: j.disopt.2007.11.009
OpenAlex ID: W2069847328
cites work: Algorithms with large domination ratio
cites work: Linear time dynamic-programming algorithms for new classes of restricted TSPs: a computational study
cites work: Q3576755
cites work: A study of exponential neighborhoods for the travelling salesman problem and for the quadratic assignment problem.
cites work: The travelling salesman problem: new solvable cases and linkages with the development of approximation algorithms
cites work: Domination analysis of combinatorial optimization problems.
cites work: TSP tour domination and Hamilton cycle decompositions of regular digraphs
cites work: Polynomial approximation algorithms for the TSP and the QAP with a factorial domination number
cites work: Q4461908
cites work: Traveling salesman should not be greedy: Domination analysis of greedy-type heuristics for the TSP
cites work: Q4526964
cites work: Approximation algorithms for combinatorial problems
cites work: Domination analysis of greedy heuristics for the frequency assignment problem.
cites work: Algorithms and Data Structures
cites work: Domination analysis of some heuristics for the traveling salesman problem
DOI: 10.1016/J.DISOPT.2007.11.009
description: scientific article; zbMATH DE number 5312360