scientific article; zbMATH DE number 5886655

MaRDI QIDQ2998795zbMATH OpenFDO

Authors Abraham P. Punnen

Publication date 10 May 2011

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• TSP heuristics: domination analysis and complexity
• Domination analysis of some heuristics for the traveling salesman problem
• A branch-and-cut and MIP-based heuristics for the prize-collecting travelling salesman problem
• A Lagrangian heuristic for the Prize Collecting Travelling Salesman Problem
• scientific article; zbMATH DE number 5010630
• The domination heuristic for LP-type problems
• Experimental analysis of Heuristic algorithms for the dominating set problem
• Domination analysis of greedy heuristics for the frequency assignment problem.
• Prize-collecting TSP with a budget constraint

Cited in

(6)

• Note on upper bounds for TSP domination number
• Domination analysis of some heuristics for the traveling salesman problem
• A domination algorithm for \(\{0,1\}\)-instances of the travelling salesman problem
• The traveling salesman problem: new polynomial approximation algorithms and domination analysis
• Domination analysis of combinatorial optimization problems.
• TSP heuristics: domination analysis and complexity

This page was built for publication:

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