22:
241:
94:. Given a list of cities, some of which are required, and the lengths of the roads between them, the goal is to find the shortest possible walk that visits each required city and then returns to the origin city. During a walk, vertices can be visited more than once, and edges may be traversed more than once.
210:
Adam N. Letchford, Saeideh D. Nasiri, and Dirk Oliver Theis. Compact formulations of the steiner traveling salesman problem and related problems.
282:
301:
179:
M. R. Garey and D. S. Johnson. Computers and
Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, 1979.
65:
43:
203:
Huili Zhang, Weitian Tong, Yinfeng Xu, and Guohui Lin. The steiner traveling salesman problem with online advanced edge blockages.
189:
Gerard
Cornuejols, Jean Fonlupt, and Denis Naddef. The traveling salesman problem on a graph and some related integer polyhedra.
182:
Huili Zhang, Weitian Tong, Yinfeng Xu, and Guohui Lin. The steiner traveling salesman problem with online edge blockages.
306:
196:
S. Borne, A.R. Mahjoub, and R. Taktak. A branch-and-cut algorithm for the multiple steiner TSP with order constraints.
91:
275:
36:
30:
47:
217:
Adam N. Letchford and
Saeideh D. Nasiri. The steiner travelling salesman problem with correlated costs.
268:
163:
113:"A GRASP heuristic using path-relinking and restarts for the Steiner traveling salesman problem"
155:
124:
252:
295:
248:
240:
167:
144:"A note on computational aspects of the Steiner traveling salesman problem"
143:
112:
159:
128:
15:
224:
Juan-Jos´e
Salazar-Gonz´alez. The steiner cycle polytope.
256:
142:Álvarez-Miranda, Eduardo; Sinnl, Markus (2019-09-05).
111:Interian, Ruben; Ribeiro, Celso C. (15 July 2017).
148:International Transactions in Operational Research
117:International Transactions in Operational Research
276:
8:
283:
269:
66:Learn how and when to remove this message
226:European Journal of Operational Research
219:European Journal of Operational Research
212:European Journal of Operational Research
198:Electronic Notes in Discrete Mathematics
184:European Journal of Operational Research
29:This article includes a list of general
103:
7:
237:
235:
205:Computers & Operations Research
80:Steiner traveling salesman problem
35:it lacks sufficient corresponding
14:
239:
20:
1:
255:. You can help Knowledge by
323:
302:Combinatorial optimization
234:
92:traveling salesman problem
90:) is an extension of the
191:Mathematical Programming
228:, 147(3):671–679, 2003.
50:more precise citations.
251:-related article is a
221:, 245(1):62–69, 2015.
214:, 228(1):83–92, 2013.
186:, 243(1):30–40, 2015.
307:Combinatorics stubs
200:, 41:487–494, 2013.
193:, 33(1):1–27, 1985.
160:10.1111/itor.12592
129:10.1111/itor.12419
264:
263:
207:, 70:26–38, 2016.
76:
75:
68:
314:
285:
278:
271:
243:
236:
172:
171:
154:(4): 1396–1401.
139:
133:
132:
123:(6): 1307–1323.
108:
71:
64:
60:
57:
51:
46:this article by
37:inline citations
24:
23:
16:
322:
321:
317:
316:
315:
313:
312:
311:
292:
291:
290:
289:
232:
176:
175:
141:
140:
136:
110:
109:
105:
100:
72:
61:
55:
52:
42:Please help to
41:
25:
21:
12:
11:
5:
320:
318:
310:
309:
304:
294:
293:
288:
287:
280:
273:
265:
262:
261:
244:
230:
229:
222:
215:
208:
201:
194:
187:
180:
174:
173:
134:
102:
101:
99:
96:
74:
73:
28:
26:
19:
13:
10:
9:
6:
4:
3:
2:
319:
308:
305:
303:
300:
299:
297:
286:
281:
279:
274:
272:
267:
266:
260:
258:
254:
250:
249:combinatorics
245:
242:
238:
233:
227:
223:
220:
216:
213:
209:
206:
202:
199:
195:
192:
188:
185:
181:
178:
177:
169:
165:
161:
157:
153:
149:
145:
138:
135:
130:
126:
122:
118:
114:
107:
104:
97:
95:
93:
89:
85:
81:
70:
67:
59:
49:
45:
39:
38:
32:
27:
18:
17:
257:expanding it
246:
231:
225:
218:
211:
204:
197:
190:
183:
151:
147:
137:
120:
116:
106:
87:
83:
79:
77:
62:
53:
34:
84:Steiner TSP
48:introducing
296:Categories
98:References
31:references
56:June 2020
168:71717255
44:improve
166:
33:, but
247:This
164:S2CID
86:, or
253:stub
88:STSP
78:The
156:doi
125:doi
298::
162:.
152:26
150:.
146:.
121:24
119:.
115:.
284:e
277:t
270:v
259:.
170:.
158::
131:.
127::
82:(
69:)
63:(
58:)
54:(
40:.
Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.
