Worst case analysis of max-regret, greedy and other heuristics for multidimensional assignment and traveling salesman problems
type: Item
instance of: scholarly article
title: Worst case analysis of max-regret, greedy and other heuristics for multidimensional assignment and traveling salesman problems
zbMATH Open document ID: 1173.90512
author: G. Gutin
author: Jing Huang
author: Boris Goldengorin
published in: Journal of Heuristics
publication date: 2009-03-31T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 5536934
zbMATH Keywords: traveling salesman problem
zbMATH Keywords: multidimensional assignment problem
zbMATH Keywords: greedy heuristics
zbMATH Keywords: domination analysis
describes a project that uses: LKH
MaRDI profile type: Publication
full work available at URL: s10732-007-9033-3
OpenAlex ID: W2012738417
cites work: Q4258216
cites work: An Algorithm for the Three-Index Assignment Problem
cites work: Greedy-type resistance of combinatorial problems
cites work: Q3576755
cites work: Q3145800
cites work: The travelling salesman problem: new solvable cases and linkages with the development of approximation algorithms
cites work: Construction heuristics for the asymmetric TSP.
cites work: The traveling salesman problem and its variations
cites work: Q3374248
cites work: Polynomial approximation algorithms for the TSP and the QAP with a factorial domination number
cites work: An effective implementation of the Lin-Kernighan traveling salesman heuristic
cites work: Q4461912
cites work: Domination analysis of greedy heuristics for the frequency assignment problem.
cites work: Q4251080
cites work: Letter to the Editor—The Multidimensional Assignment Problem
cites work: Multidimensional assignment formulation of data association problems arising from multitarget and multisensor tracking
cites work: Q4461903
cites work: Domination analysis of some heuristics for the traveling salesman problem
cites work: TSP heuristics: domination analysis and complexity
cites work: Tracking elementary particles near their primary vertex: A combinatorial approach
cites work: Q3284265
cites work: A set of greedy randomized adaptive local search procedure (GRASP) implementations for the multidimensional assignment problem
DOI: 10.1007/S10732-007-9033-3
description: scientific article; zbMATH DE number 5536934