The symmetric travelling salesman problem II. New low bounds

Authors:
S. I. Sergeev
Affiliations:
Moscow State University of Economics, Statistics, and Informatics, Moscow, Russia
Venue:
Automation and Remote Control
Year:
2010

Citing 4
Cited 1

Combinatorial optimization: algorithms and complexity

Combinatorial optimization: algorithms and complexity
Improved Lower Bounds for the Quadratic Assignment Problem

Automation and Remote Control
Graph theory: An algorithmic approach (Computer science and applied mathematics)

Graph theory: An algorithmic approach (Computer science and applied mathematics)
The symmetric travelling salesman problem I. New fast lower bounds for the problem of optimal 2-matching

Automation and Remote Control

Nonlinear resolving functions for the travelling salesman problem

Automation and Remote Control

Quantified Score

Hi-index	0.00

Visualization

Abstract

The branch-and-bound method is adduced for the symmetric salesman problem where two lower bounds are proposed as bounds. The first bound is a solution to the problem of optimal 2-matching; the second one, to the problem of minimum spanning 1-tree. The last bound is enhanced by applying the problem of optimal 2-matching. Both these bounds considerably improve the symmetric traveling salesman problem as compared to the asymmetric problem.