The symmetric travelling salesman problem. I: New fast lower bounds for the problem of optimal 2-matching
From MaRDI portal
Publication:2654962
DOI10.1134/S0005117909110149zbMath1231.90326MaRDI QIDQ2654962
Publication date: 22 January 2010
Published in: Automation and Remote Control (Search for Journal in Brave)
Related Items (3)
Maximum travelling salesman problem. I ⋮ The symmetric travelling salesman problem. II: New low bounds ⋮ Nonlinear resolving functions for the travelling salesman problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Lower bounds for the symmetric travelling salesman problem from Lagrangean relaxations
- The traveling salesman problem. I: Theoretical issues
- An improved assignment lower bound for the Euclidean traveling salesman problem
- Computer algorithms for the solution of some linear and linear integer programming problems. I-IV
- A cutting plane algorithm for minimum perfect 2-matchings
- Computational algorithms for the solution of the salesman problem. I: General pattern of classification
- The three-dimensional assignment and partition problems. New lower bounds
- An analysis of alternative strategies for implementing matching algorithms
- Efficient algorithms for finding maximum matching in graphs
- Better assignment lower bounds for the Euclidean traveling salesman problem
- Relaxation Methods for Linear Programs
- Technical Note—Rounding Symmetric Traveling Salesman Problems with an Asymmetric Assignment Problem
- A restricted Lagrangean approach to the traveling salesman problem
- A new algorithm for the assignment problem
- Paths, Trees, and Flowers
- Pathology of Traveling-Salesman Subtour-Elimination Algorithms
- The Traveling-Salesman Problem and Minimum Spanning Trees
This page was built for publication: The symmetric travelling salesman problem. I: New fast lower bounds for the problem of optimal 2-matching
