Note on upper bounds for TSP domination number

MaRDI QIDQ3415356zbMATH OpenFDO

Authors G. Gutin, Angela Koller, A. Yeo

Publication date 18 January 2007

Full work available at URL http://journals.hil.unb.ca/index.php/AOR/article/view/97

zbMATH Keywords

asymmetric travelling salesman problemdomination number

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Domination analysis of some heuristics for the traveling salesman problem
• TSP heuristics: domination analysis and complexity
• TSP tour domination and Hamilton cycle decompositions of regular digraphs
• scientific article; zbMATH DE number 5886655
• The traveling salesman problem: new polynomial approximation algorithms and domination analysis

Cited in

(4)

• TSP heuristics: domination analysis and complexity
• Domination analysis of some heuristics for the traveling salesman problem
• A domination algorithm for \(\{0,1\}\)-instances of the travelling salesman problem
• Dominance guarantees for above-average solutions

This page was built for publication: Note on upper bounds for TSP domination number

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3415356)