Maximum travelling salesman problem. I
type: Item
instance of: scholarly article
title: Maximum travelling salesman problem. I
zbMATH Open document ID: 1327.90266
DOI: 10.1134/S0005117914120078
author: S. Sergeev
published in: Automation and Remote Control
publication date: 2015-11-17T00:00:00Z
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 6509614
MaRDI profile type: Publication
cites work: Q5187226
cites work: The traveling salesman problem. I: Theoretical issues
cites work: The traveling salesman problem and its variations
cites work: Computer algorithms for the solution of some linear and linear integer programming problems. I-IV
cites work: Algorithms for solution of the travelling salesman problem. II: New lower bound
cites work: Nonlinear resolving functions for the travelling salesman problem
cites work: Q5519710
cites work: Algorithms for the Assignment and Transportation Problems
cites work: Letter to the Editor—An Algorithm for Ranking all the Assignments in Order of Increasing Cost
cites work: Pathology of Traveling-Salesman Subtour-Elimination Algorithms
cites work: Q3777813
cites work: Q3686457
cites work: Q3215871
cites work: Q4855775
cites work: Q4002409
cites work: A restricted Lagrangean approach to the traveling salesman problem
cites work: The symmetric travelling salesman problem. I: New fast lower bounds for the problem of optimal 2-matching
full work available at URL: s0005117914120078
OpenAlex ID: W2087427816
description: scientific article; zbMATH DE number 6509614