A solvable case of the traveling salesman problem

DOI10.1007/BF01584089MaRDI QIDQ5653802zbMATH OpenOpenAlexFDO

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

Cites work

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

Cited in

(4)

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

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

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