Worst case analysis of nearest neighbour algorithms for the minimum weighted directed k-cycle problem
From MaRDI portal
Publication:3385394
zbMATH Open1476.90290MaRDI QIDQ3385394FDOQ3385394
Authors: Piyashat Sripratak 
Publication date: 18 December 2021
Full work available at URL: http://thaijmath.in.cmu.ac.th/index.php/thaijmath/article/view/4590
Recommendations
- Traveling salesman should not be greedy: Domination analysis of greedy-type heuristics for the TSP
- Weighted nearest neighbor algorithms for the graph exploration problem on cycles
- Weighted Nearest Neighbor Algorithms for the Graph Exploration Problem on Cycles
- Approximation result toward nearest neighbor heuristic
- On the nearest neighbor rule for the metric traveling salesman problem
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Cites Work
- The traveling salesman problem. A computational study.
- \(z\)-approximations
- The traveling salesman. Computational solutions for RSP applications
- Traveling salesman should not be greedy: Domination analysis of greedy-type heuristics for the TSP
- The travelling salesman problem: new solvable cases and linkages with the development of approximation algorithms
- Title not available (Why is that?)
- Average value of solutions for the bipartite Boolean quadratic programs and rounding algorithms
- Title not available (Why is that?)
- Measuring the Quality of Approximate Solutions to Zero-One Programming Problems
- Title not available (Why is that?)
- Dominance guarantees for above-average solutions
Cited In (1)
This page was built for publication: Worst case analysis of nearest neighbour algorithms for the minimum weighted directed \(k\)-cycle problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3385394)
