Approximate algorithms for the traveling salesman problem. II
From MaRDI portal
(Redirected from Publication:499569)
Recommendations
Cites work
- scientific article; zbMATH DE number 3426330 (Why is no real title available?)
- scientific article; zbMATH DE number 3910163 (Why is no real title available?)
- scientific article; zbMATH DE number 4037617 (Why is no real title available?)
- scientific article; zbMATH DE number 194516 (Why is no real title available?)
- scientific article; zbMATH DE number 818451 (Why is no real title available?)
- scientific article; zbMATH DE number 3895002 (Why is no real title available?)
- A restricted Lagrangean approach to the traveling salesman problem
- Algorithms for solution of the travelling salesman problem. II: New lower bound
- Approximate synthesis of optimal control
- Computer algorithms for the solution of some linear and linear integer programming problems. I-IV
- Discrete optimization by optimal control methods. I: Separable problems
- Maximum travelling salesman problem. I
- Nonlinear resolving functions for the travelling salesman problem
- Reduced complexity dynamic programming based on policy iteration
- Successive approximations of Bellman's function
- The traveling salesman problem and its variations
Cited in
(17)- The traveling salesman problem. Approximate algorithms
- A historical note on the 3/2-approximation algorithm for the metric traveling salesman problem
- scientific article; zbMATH DE number 4095236 (Why is no real title available?)
- Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
- scientific article; zbMATH DE number 1839451 (Why is no real title available?)
- A diagonal completion and 2-optimal procedure for the travelling salesman problem
- scientific article; zbMATH DE number 5158919 (Why is no real title available?)
- Discrete optimization by optimal control methods. III. The dynamic traveling salesman problem
- scientific article; zbMATH DE number 4053382 (Why is no real title available?)
- Algorithms and Experimental Study for the Traveling Salesman Problem of Second Order
- scientific article; zbMATH DE number 4037617 (Why is no real title available?)
- The physicist's approach to the travelling salesman problem. II
- A sequence for using algorithms for the approximate solution in the hybrid algorithm for solving the travelling salesman problem
- On the approximability of the traveling salesman problem
- Sharp bounds for Karp's “patching”-algorithm for the approximate solution of the traveling salesman problem
- Two truck travelling salesman simulation
- Maximum travelling salesman problem. I
This page was built for publication: Approximate algorithms for the traveling salesman problem. II
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q499569)
