Maximum travelling salesman problem. I
From MaRDI portal
Publication:891481
DOI10.1134/S0005117914120078zbMath1327.90266OpenAlexW2087427816MaRDI QIDQ891481
Publication date: 17 November 2015
Published in: Automation and Remote Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s0005117914120078
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Nonlinear resolving functions for the travelling salesman problem
- The traveling salesman problem. I: Theoretical issues
- Computer algorithms for the solution of some linear and linear integer programming problems. I-IV
- The traveling salesman problem and its variations
- Algorithms for solution of the travelling salesman problem. II: New lower bound
- The symmetric travelling salesman problem. I: New fast lower bounds for the problem of optimal 2-matching
- Algorithms for the Assignment and Transportation Problems
- A restricted Lagrangean approach to the traveling salesman problem
- Letter to the Editor—An Algorithm for Ranking all the Assignments in Order of Increasing Cost
- Pathology of Traveling-Salesman Subtour-Elimination Algorithms
This page was built for publication: Maximum travelling salesman problem. I
