scientific article; zbMATH DE number 2080248

MaRDI QIDQ4472495zbMATH OpenFDO

Authors Norihiro Kubo, Katsuhiro Muramoto, Shinichi Shimozono

Publication date 4 August 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/1969/19690216.htm

Mathematics Subject Classification ID

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

Recommendations

• An algorithm for the approximate solution of a large-scale travelling salesman problem in a plane
• scientific article; zbMATH DE number 3999697
• scientific article; zbMATH DE number 4095236
• Approximation algorithms for the traveling salesman problem
• The traveling salesman problem. Approximate algorithms
• An approximation algorithm for the maximum traveling salesman problem
• An approximation algorithm for the maximum traveling salesman problem
• On the approximability of the traveling salesman problem
• scientific article; zbMATH DE number 598850
• An approximation algorithm for the TSP

Cited in

(8)

• An approximation algorithm for the TSP
• Experimental comparison of two heuristic algorithms for one generalization of the large-scale planar travelling-salesman problem
• The traveling salesman problem with few inner points
• Approximation algorithms for TSP with neighborhoods in the plane
• scientific article; zbMATH DE number 3882232 (Why is no real title available?)
• A Linear-Time Approximation Scheme for TSP in Undirected Planar Graphs with Edge-Weights
• scientific article; zbMATH DE number 1163704 (Why is no real title available?)
• Engineering an approximation scheme for traveling salesman in planar graphs

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 Q4472495)