Approximate algorithms for the traveling salesman problem. II
type: Item
instance of: scholarly article
title: Approximate algorithms for the traveling salesman problem. II
zbMATH Open document ID: 1327.90398
DOI: 10.1134/S0005117915030108
author: S. Sergeev
published in: Automation and Remote Control
publication date: 2015-09-30T00:00:00Z
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 6487608
MaRDI profile type: Publication
cites work: Q5187226
cites work: The traveling salesman problem and its variations
cites work: Approximate synthesis of optimal control
cites work: Q3215871
cites work: Q4855775
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: Algorithms for solution of the travelling salesman problem. II: New lower bound
cites work: Nonlinear resolving functions for the travelling salesman problem
cites work: Maximum travelling salesman problem. I
cites work: Q3777813
cites work: Q3686457
cites work: Discrete optimization by optimal control methods. I: Separable problems
cites work: Successive approximations of Bellman's function
cites work: Reduced complexity dynamic programming based on policy iteration
cites work: Q4692473
description: scientific article; zbMATH DE number 6487608