| 1 |
LENSTRA J,KAN A.Some simple applications of the traveling salesman problem[J].Journal ofthe Operational Research Society,1975,26(4): 717-733.
doi: 10.1057/jors.1975.15
|
| 2 |
TANG L X，LIU J Y,RONG A Y,et al.A multiple traveling salesman problem model for hot rolling scheduling in Shangai Baoshan Iron & Steel Complex[J].European Journal of Operational Research,2000,124(2):267-282.
doi: 10.1016/S0377-2217(99)00380-X
|
| 3 |
Gilbert K C,Hofstra R B.A new multiperiod multiple traveling salesman problem with heuristic and application to a scheduling problem[J].Decision Sciences,1922,23(1):250-259.
doi: 10.1111/j.1540-5915.1992.tb00387.x
|
| 4 |
BRUMMIT B,STENTZ A.Dynamic mission planning for multiple mobile robots[M]//Intelligent Unmanned Ground Vehicles.Boston,MA: Springer,1997.
doi: 10.1007/978-1-4615-6325-9_12
|
| 5 |
GORENSTEIN S.Printing press scheduling for multi-edition periodicals[J].Management Science,1970,16 (6): B373-B383.
|
| 6 |
GAREY M R,JOHNSON D S.Computers and intractability: A guide to the theory of NP-completeness[J].SIAM Rev,1982,24(1): 90-91.
doi: 10.1137/1024022
|
| 7 |
CHU S C,RODDICK J F,PAN J S.Ant colony system with communication strategies[J].Information Sciences,2004,167 (1/2/3/4): 63-76.
doi: 10.1016/j.ins.2003.10.013
|
| 8 |
WANG X Y,GOLDEN B,WASIL E.A Steiner zone variable neighborhood search heuristic for the Close-Enough Traveling Salesman Problem[J].Computers & Operations Research,2019,101: 200-219.
doi: 10.1016/j.cor.2018.07.023
|
| 9 |
AGATZ N,BOUMAN P,SCHMIDT M.Optimization approaches for the traveling salesman problem with drone[J].Transportation Science,2018,52(4):739-1034.
doi: 10.1287/trsc.2017.0791
|
| 10 |
MALAGUTI E,MARTELLO S,SANTINI A.The traveling salesman problem with pickups,deliveries,and draft limits[J].Omega,2018,74: 50-58.
doi: 10.1016/j.omega.2017.01.005
|
| 11 |
CHOONG S S,WONG L P,LIM C P.An artificial bee colony algorithm with a modified choice function for the Traveling Salesman Problem[J].Swarm and Evolutionary Computation,2019,44: 622-635.
doi: 10.1016/j.swevo.2018.08.004
|
| 12 |
ZHANG T J,KE L J,LI J,et al.Metaheuristics for the tabu clustered traveling salesman problem[J].Computers & Operations Research,2018,89: 1-12.
doi: 10.1016/j.cor.2017.07.008
|
| 13 |
DANTZIG G,FULKERSON R,JOHNSON S.Solutions of large scale travelling salesman problem[J].Journal of the Operations Research Society of America,1954,2(4):393-410.
doi: 10.1287/opre.2.4.393
|
| 14 |
MILLER C E,TUCKER A W,ZEMLIN R A.Integer programming formulations and travelling salesman problems[J].Journal of ACM,1960,7(4):326-329.
doi: 10.1145/321043.321046
|
| 15 |
DESROCHERS M,LAPORTE G.Improvements and extensions to the Miller-Tucker-Zemlin subtour elimination constraints[J].Operations Research Letters,1991,10(1):27-36.
doi: 10.1016/0167-6377(91)90083-2
|
| 16 |
SHERALI H D,DRISCOLL P J.On tightening the relaxations of Miller-Tucker-Zemlin formulations for asymmetric traveling salesman problems[J].Operations Research,2002,50(4): 656-669.
doi: 10.1287/opre.50.4.656.2865
|
| 17 |
SARIN S C,SHERALI H D,BHOOTRA A.New tighter polynomial length formulations for the asymmetric traveling salesman problem with and without precedence constraints[J].Operations Research Letters,2005,33(1): 62-70.
doi: 10.1016/j.orl.2004.03.007
|
| 18 |
GRTSCHEL M,PADBERG M.On the symmetric traveling salesman problem II: Liftings and facets[J].Mathematical Programming,1979,16(1): 281-302.
doi: 10.1007/BF01582117
|
| 19 |
DRISCOLL P J.A new hierarchy of relaxation for 0-1 mixed integer problems with application to some specially structured problems[EB/OL].[2019-03-01].http://hdl.handle.net/10919/49936.
|
