An efficient procedure for the N-city traveling salesman problem

DOI10.1016/0895-7177(90)90376-XzbMATH Open0691.90059OpenAlexW2061775329MaRDI QIDQ583107FDOQ583107

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

assignmenttraveling salesmanadditional constraints

Mathematics Subject Classification ID

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

Cites Work

• Partitioning procedures for solving mixed-variables programming problems
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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)