Maximum travelling salesman problem. I (Q891481)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Maximum travelling salesman problem. I	scientific article

Statements

scholarly article

0 references

Maximum travelling salesman problem. I (English)

0 references

zbMATH Open document ID

0 references

10.1134/S0005117914120078

0 references

0 references

Automation and Remote Control

0 references

publication date

17 November 2015

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

MaRDI profile type

MaRDI publication profile

0 references

0 references

The traveling salesman problem. I: Theoretical issues

0 references

The traveling salesman problem and its variations

0 references

Computer algorithms for the solution of some linear and linear integer programming problems. I-IV

0 references

Algorithms for solution of the travelling salesman problem. II: New lower bound

0 references

Nonlinear resolving functions for the travelling salesman problem

0 references

0 references

Algorithms for the Assignment and Transportation Problems

0 references

Letter to the Editor—An Algorithm for Ranking all the Assignments in Order of Increasing Cost

0 references

Pathology of Traveling-Salesman Subtour-Elimination Algorithms

0 references

0 references

0 references

0 references

0 references

0 references

A restricted Lagrangean approach to the traveling salesman problem

0 references

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

0 references

full work available at URL

https://doi.org/10.1134/s0005117914120078

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:891481

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q891481&oldid=37412101"