scientific article

zbMath1476.90290MaRDI QIDQ3385394

Piyashat Sripratak

Publication date: 18 December 2021

Full work available at URL: http://thaijmath.in.cmu.ac.th/index.php/thaijmath/article/view/4590

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

worst case analysisgreedy heuristicminimum weightk-cycle

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Average value of solutions for the bipartite Boolean quadratic programs and rounding algorithms
• Dominance guarantees for above-average solutions
• The traveling salesman. Computational solutions for RSP applications
• Traveling salesman should not be greedy: Domination analysis of greedy-type heuristics for the TSP
• z-Approximations
• Measuring the Quality of Approximate Solutions to Zero-One Programming Problems
• The travelling salesman problem: new solvable cases and linkages with the development of approximation algorithms

This page was built for publication: