scientific article; zbMATH DE number 3575371

MaRDI QIDQ4145160zbMATH OpenFDO

Authors T. H. C. Smith, G. L. Thompson

Publication date 1977

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Numerical mathematical programming methods (65K05) Integer programming (90C10) Programming involving graphs or networks (90C35)

Cited in

(12)

• Embedding learning capability in Lagrangean relaxation: an application to the travelling salesman problem
• 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 branch and bound algorithm for symmetric 2-peripatetic salesman problems
• New lower bounds for the symmetric travelling salesman problem
• The traveling salesman problem with backhauls
• A note on relatives to the Held and Karp 1-tree problem
• A successful algorithm for solving directed Hamiltonian path problems
• Minimum deviation and balanced optimization: A unified approach
• Solution of large-scale symmetric travelling salesman problems
• Lower bounds for the symmetric travelling salesman problem from Lagrangean relaxations

This page was built for publication:

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