Generating Travelling-Salesman Problems with Known Optimal Tours

DOI10.1057/JORS.1988.27zbMath0643.90060OpenAlexW2067715194MaRDI QIDQ3786279

Jeffrey L. Arthur, James O. Frendewey

Publication date: 1988

Published in: 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

problem generatortravelling-salesmandual assignment relaxation

Mathematics Subject Classification ID

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

Related Items (4)

GENGUB: A generator for linear programs with generalized upper bound constraints ⋮ Routing problems: A bibliography ⋮ Designing and reporting on computational experiments with heuristic methods ⋮ An effective implementation of the Lin-Kernighan traveling salesman heuristic

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