scientific article; zbMATH DE number 3575371
From MaRDI portal
Publication:4145160
zbMath0368.90109MaRDI QIDQ4145160
T. H. C. Smith, Gerald L. Thompson
Publication date: 1977
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Numerical mathematical programming methods (65K05) Integer programming (90C10)
Related Items
The traveling salesman problem with backhauls, Lower bounds for the symmetric travelling salesman problem from Lagrangean relaxations, A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation, The symmetric traveling salesman problem and edge exchanges in minimal 1- trees, The traveling salesman problem: An overview of exact and approximate algorithms, A note on relatives to the Held and Karp 1-tree problem, New lower bounds for the symmetric travelling salesman problem, Embedding learning capability in Lagrangean relaxation: an application to the travelling salesman problem, A successful algorithm for solving directed Hamiltonian path problems, A branch and bound algorithm for symmetric 2-peripatetic salesman problems, Minimum deviation and balanced optimization: A unified approach, Solution of large-scale symmetric travelling salesman problems
