Nonlinear resolving functions for the travelling salesman problem

DOI10.1134/S0005117913060088zbMath1297.90142MaRDI QIDQ462011

S. I. Sergeev

Publication date: 15 October 2014

Published in: Automation and Remote Control (Search for Journal in Brave)

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

Related Items (3)

Maximum travelling salesman problem. I ⋮ Approximate algorithms for the traveling salesman problem. II ⋮ Probabilistic prediction of the complexity of traveling salesman problems based on approximating the complexity distribution from experimental data

Cites Work

• Unnamed Item
• Unnamed Item
• The traveling salesman problem. I: Theoretical issues
• Computer algorithms for the solution of some linear and linear integer programming problems. I-IV
• The traveling salesman problem and its variations
• The symmetric travelling salesman problem. I: New fast lower bounds for the problem of optimal 2-matching
• A restricted Lagrangean approach to the traveling salesman problem
• The Traveling-Salesman Problem and Minimum Spanning Trees

This page was built for publication: Nonlinear resolving functions for the travelling salesman problem