Generating Travelling-Salesman Problems with Known Optimal Tours

DOI10.1057/JORS.1988.27MaRDI QIDQ3786279zbMATH OpenOpenAlexFDO

Authors Jeffrey L. Arthur, James O. Frendewey

Publication date 1988

Published in The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1057/jors.1988.27

zbMATH Keywords

dual assignment relaxationproblem generatortravelling-salesman

Mathematics Subject Classification ID

Integer programming (90C10) Programming involving graphs or networks (90C35)

Recommendations

• scientific article; zbMATH DE number 91756
• scientific article; zbMATH DE number 1947373
• scientific article; zbMATH DE number 795217
• Provably good solutions for the traveling salesman problem
• Generating quadratic assignment test problems with known optimal permutations

Cited in

(8)

• An effective implementation of the Lin-Kernighan traveling salesman heuristic
• Routing problems: A bibliography
• Designing and reporting on computational experiments with heuristic methods
• GENGUB: A generator for linear programs with generalized upper bound constraints
• scientific article; zbMATH DE number 91756 (Why is no real title available?)
• scientific article; zbMATH DE number 2158096 (Why is no real title available?)
• Evolutionary Computation in Combinatorial Optimization
• On the generation of metric TSP instances with a large integrality gap by branch-and-cut

This page was built for publication: Generating Travelling-Salesman Problems with Known Optimal Tours

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