Travelling salesman problem tools for microcomputers (Q1184464): Difference between revisions

@@ Property / author @@
-Kimmo Nurmi
@@ Property / author: Kimmo Nurmi / rank @@
-Normal rank
@@ Property / describes a project that uses @@
+TRAVEL
@@ Property / describes a project that uses: TRAVEL / rank @@
+Normal rank
@@ Property / author @@
+Kimmo Nurmi
@@ Property / author: Kimmo Nurmi / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+The Traveling-Salesman Problem and Minimum Spanning Trees
+Normal rank
@@ Property / cites work @@
+Design of linear quadratic regulators with assigned eigenstructure
+Normal rank
@@ Property / cites work @@
+Computer Solutions of the Traveling Salesman Problem
+Normal rank
@@ Property / cites work @@
+An Effective Heuristic Algorithm for the Traveling-Salesman Problem
+Normal rank
@@ Property / cites work @@
+Some Methods of Producing Approximate Solutions to Travelling Salesman Problems with Hundreds or Thousands of Cities
+Normal rank
@@ Property / cites work @@
+Local Search for the Asymmetric Traveling Salesman Problem
+Normal rank
@@ Property / cites work @@
+TRAVEL - An interactive travelling salesman problem package for the IBM- personal computer
+Normal rank
@@ Property / cites work @@
+A restricted Lagrangean approach to the traveling salesman problem
+Normal rank
@@ Property / cites work @@
+Improving the Hungarian assignment algorithm
@@ Property / cites work: Improving the Hungarian assignment algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+Matching, Euler tours and the Chinese postman
@@ Property / cites work: Matching, Euler tours and the Chinese postman / rank @@
+Normal rank
@@ Property / cites work @@
+A shortest augmenting path method for solving minimal perfect matching problems
+Normal rank
@@ Property / cites work @@
+A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation
+Normal rank
@@ Property / cites work @@
+Some New Branching and Bounding Criteria for the Asymmetric Travelling Salesman Problem
+Normal rank
@@ Property / cites work @@
+Optimization of the movements of a component placement machine
+Normal rank
@@ Property / cites work @@
+On the symmetric travelling salesman problem: Solution of a 120-city problem
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0305-0548(91)90012-g
+Normal rank
@@ Property / OpenAlex ID @@
+W2011416092
@@ Property / OpenAlex ID: W2011416092 / rank @@
+Normal rank