36:
239:
244:
229:
123:
234:
205:
193:
159:
135:
48:
22:
89:
147:
210:
111:
94:
176:
8:
99:
171:
17:
181:
223:
77:
35:
The following 18 pages are in this category, out of 18 total.
65:
60:
221:
32:Pages in category "Travelling salesman problem"
37:This list may not reflect recent changes
240:Computational problems in graph theory
222:
245:Mathematical optimization in business
124:In Pursuit of the Traveling Salesman
13:
41:
29:
14:
256:
1:
230:Problems in spatial analysis
206:Variable neighborhood search
30:
7:
194:Traveling purchaser problem
160:Nearest neighbour algorithm
49:Travelling salesman problem
23:Travelling salesman problem
10:
261:
235:Combinatorial optimization
90:Canadian traveller problem
16:The main article for this
15:
148:Multi-fragment algorithm
211:Vehicle routing problem
136:Lin–Kernighan heuristic
95:Christofides algorithm
177:Stacker crane problem
112:Held–Karp algorithm
100:Concorde TSP Solver
252:
260:
259:
255:
254:
253:
251:
250:
249:
220:
219:
218:
217:
216:
215:
198:
186:
172:Set TSP problem
164:
152:
140:
128:
116:
104:
82:
70:
53:
28:
27:
12:
11:
5:
258:
248:
247:
242:
237:
232:
214:
213:
208:
202:
199:
197:
196:
190:
187:
185:
184:
182:Supnick matrix
179:
174:
168:
165:
163:
162:
156:
153:
151:
150:
144:
141:
139:
138:
132:
129:
127:
126:
120:
117:
115:
114:
108:
105:
103:
102:
97:
92:
86:
83:
81:
80:
74:
71:
69:
68:
63:
57:
54:
52:
51:
45:
43:
42:
33:
9:
6:
4:
3:
2:
257:
246:
243:
241:
238:
236:
233:
231:
228:
227:
225:
212:
209:
207:
204:
203:
200:
195:
192:
191:
188:
183:
180:
178:
175:
173:
170:
169:
166:
161:
158:
157:
154:
149:
146:
145:
142:
137:
134:
133:
130:
125:
122:
121:
118:
113:
110:
109:
106:
101:
98:
96:
93:
91:
88:
87:
84:
79:
76:
75:
72:
67:
64:
62:
59:
58:
55:
50:
47:
46:
44:
40:
38:
31:
25:
24:
19:
34:
21:
78:Arc routing
224:Categories
18:category
66:3-opt
61:2-opt
56:0–9
20:is
226::
39:.
201:V
189:T
167:S
155:N
143:M
131:L
119:I
107:H
85:C
73:A
26:.
Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.