A solvable case of the traveling salesman problem

DOI10.1007/BF01584089zbMath0242.90036OpenAlexW2076341540MaRDI QIDQ5653802

Eugene L. Lawler

Publication date: 1971

Published in: Mathematical Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01584089

Mathematics Subject Classification ID

Integer programming (90C10)

Related Items (4)

Efficiently solvable special cases of bottleneck travelling salesman problems ⋮ Universal conditions for algebraic travelling salesman problems to be efficiently solvable ⋮ Reduction of job-shop problems to flow-shop problems with precedence constraints ⋮ Four-point conditions for the TSP: the complete complexity classification

Cites Work

• Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
• A note on shortest path, assignment, and transportation problems

This page was built for publication: A solvable case of the traveling salesman problem