Category:Traveling salesman problem
Pereiti į navigaciją
Jump to search
NP-hard problem in combinatorial optimization  | |||||
| Įkelti mediją | |||||
| Tai yra |
| ||||
|---|---|---|---|---|---|
| Pavadintas pagal |
| ||||
| |||||
 | |||||
Daugialypės terpės rinkmenos kategorijoje „Traveling salesman problem“
Rodomi 38 šios kategorijos rinkmenos (iš viso kategorijoje yra 38 rinkmenos).
-
2-opt Swap Path Visualization.gif 1 000 × 1 000; 193 KiB
-
2-opt wiki.svg 306 × 396; 13 KiB
-
3D TSP solved with simulated annealing 2.5 MB.gif 500 × 500; 2,91 MiB
-
3D-TSP-solved with simulated annealing.gif 900 × 900; 5,49 MiB
-
A Very Short Route Through All National Parks in the Western United States.png 1 014 × 1 100; 1,15 MiB
-
Aco TSP.svg 1 000 × 375; 85 KiB
-
An algorithm for solving a range constrained traveling salesman problem. (IA algorithmforsolv00harm).pdf 1 250 × 1 650, 108 puslapiai; 2,53 MiB
-
Bitonic tour.svg 657 × 531; 3 KiB
-
Branchbound.gif 648 × 301; 993 KiB
-
Bruteforce.gif 650 × 294; 2,46 MiB
-
Example The travelling salesman problem (TSP) penalty cost 1.gif 271 × 249; 3 KiB
-
Example The travelling salesman problem (TSP) penalty cost 2.gif 272 × 238; 2 KiB
-
Example The travelling salesman problem (TSP) scarch tree 1.gif 350 × 216; 2 KiB
-
Example The travelling salesman problem (TSP) scarch tree 2.gif 389 × 225; 3 KiB
-
Example The travelling salesman problem (TSP) tree seartch P0.gif 277 × 241; 2 KiB
-
Example The travelling salesman problem (TSP) tree seartch P1.gif 267 × 235; 2 KiB
-
Example The travelling salesman problem (TSP) tree seartch P2.gif 271 × 241; 3 KiB
-
Example The travelling salesman problem (TSP) tree seartch P3.gif 280 × 243; 3 KiB
-
Example The travelling salesman problem (TSP).gif 272 × 234; 2 KiB
-
GLPK solution of a travelling salesman problem.svg 512 × 512; 7 KiB
-
Graph-G.png 1 890 × 632; 15 KiB
-
Graph-HamiltonPath.png 1 655 × 1 093; 27 KiB
-
MATLAB Travelling Salesman.gif 435 × 323; 1,17 MiB
-
Routing a USCG buoytender to service aids to navigation - a case of the traveling salesman problem. (IA routinguscgbuoyt00bech).pdf 1 181 × 1 600, 86 puslapiai; 4,3 MiB
-
Rundtur.GIF 369 × 142; 3 KiB
-
Sa poland tsp.gif 793 × 775; 2,23 MiB
-
Salesman.PNG 396 × 346; 7 KiB
-
Slumptur.GIF 323 × 246; 6 KiB
-
Trav-sale-prob.svg 541 × 340; 7 KiB
-
Travelling salesman problem in 3D solved with simulated annealing.gif 900 × 900; 5,49 MiB
-
Travelling salesman problem solved with simulated annealing.gif 512 × 512; 2,26 MiB
-
Tsp By GA.jpg 528 × 490; 69 KiB
-
TSP cutting plane.png 983 × 733; 8 KiB
-
TSP degree constraints.png 857 × 551; 6 KiB
-
TSP Deutschland 3.png 326 × 350; 15 KiB
-
Tsp instance.png 264 × 261; 7 KiB
-
Tsp opt.png 264 × 261; 9 KiB
-
Tsp solution debile.png 264 × 261; 9 KiB
_penalty_cost_1.gif)
_penalty_cost_2.gif)
_scarch_tree_1.gif)
_scarch_tree_2.gif)
_tree_seartch_P0.gif)
_tree_seartch_P1.gif)
_tree_seartch_P2.gif)
_tree_seartch_P3.gif)
.gif)
