The symmetric travelling salesman problem I. New fast lower bounds for the problem of optimal 2-matching

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

Citing 7
Cited 1

Efficient algorithms for finding maximum matching in graphs

ACM Computing Surveys (CSUR)
Combinatorial optimization: algorithms and complexity

Combinatorial optimization: algorithms and complexity
Relaxation methods for linear programs

Mathematics of Operations Research
A cutting plane algorithm for minimum perfect 2-matchings

Computing
Lower bounds for the symmetric travelling salesman problem from Lagrangean relaxations

Discrete Applied Mathematics - Southampton conference on combinatorial optimization, April 1987
A fast lower bound for the minimum cost perfect 2-matching linear program

American Journal of Mathematical and Management Sciences - Special issue: vehicle routing 2000: advances in time windows, optimality, fast bounds, & multi-depot routing
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 II. New low bounds

Automation and Remote Control

Quantified Score

Hi-index	0.00

Visualization

Abstract

To solve the symmetric travelling salesman problem we suggest a lower bound--the solution of an optimal 2-matching problem. The latter problem is solved (in a polynomial number of steps) not completely, but up to obtaining new stable lower bounds.