An efficient procedure for the N-city traveling salesman problem

DOI10.1016/0895-7177(90)90376-XzbMath0691.90059OpenAlexW2061775329MaRDI QIDQ583107

Bruce R. Feiring

Publication date: 1990

Published in: Mathematical and Computer Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0895-7177(90)90376-x

zbMATH Keywords

traveling salesmanassignmentadditional constraints

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Linear programming (90C05) Boolean programming (90C09)

Cites Work

• Partitioning procedures for solving mixed-variables programming problems
• Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality
• Unnamed Item
• Unnamed Item

This page was built for publication: An efficient procedure for the N-city traveling salesman problem