An efficient procedure for the N-city traveling salesman problem

DOI10.1016/0895-7177(90)90376-XMaRDI QIDQ583107zbMATH OpenOpenAlexFDO

Authors 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

additional constraintsassignmenttraveling salesman

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 3859178 (Why is no real title available?)
• scientific article; zbMATH DE number 3895002 (Why is no real title available?)
• Partitioning procedures for solving mixed-variables programming problems
• Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality

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

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