The symmetric travelling salesman problem. II: New low bounds
type: Item
instance of: scholarly article
title: The symmetric travelling salesman problem. II: New low bounds
zbMATH Open document ID: 1206.90154
DOI: 10.1134/S0005117910040090
author: S. Sergeev
published in: Automation and Remote Control
publication date: 2010-09-24T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 5790910
MaRDI profile type: Publication
cites work: The symmetric travelling salesman problem. I: New fast lower bounds for the problem of optimal 2-matching
cites work: Computer algorithms for the solution of some linear and linear integer programming problems. I-IV
cites work: A restricted Lagrangean approach to the traveling salesman problem
cites work: The traveling salesman problem. I: Theoretical issues
cites work: The traveling salesman problem and its variations
cites work: Integer programming approaches to the travelling salesman problem
cites work: Q3215871
cites work: Q4855775
cites work: Algorithms for the minimax problem of the travelling salesman. II: Dual approach
cites work: Q4083324
cites work: Q3734166
cites work: The quadratic assignment problem. I: New lower bounds in paired assignment
cites work: Improved lower bounds for the quadratic assignment problem
cites work: A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation
cites work: The Traveling-Salesman Problem and Minimum Spanning Trees
description: scientific article; zbMATH DE number 5790910