On the high multiplicity traveling salesman problem

Discrete Optimization

Volumn 3, Issue 1, 2006, Pages 50-62

  Grigoriev, Alexander ^a   Van De Klundert, Joris ^b  

^a MAASTRICHT UNIVERSITY   (Netherlands)

^b MAASTRICHT UNIVERSITY   (Netherlands)

Author keywords

High multiplicity; Traveling salesman problem

Indexed keywords

COMPUTER SCIENCE;

HIGH MULTIPLICITY; MULTIPLICATOR;

TRAVELING SALESMAN PROBLEM;

EID: 33244480866     PISSN: 15725286     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disopt.2005.11.002     Document Type: Article

References (14)

1. A. Agnetis No-wait flowshop scheduling with large lot size Annals of Operations Research 70 1997 415 438
2. T. Ahuja, F. Magnanti, and D. Orlin Network Flows 1994 Wiley Interscience San Francisco
3. J.J. Clifford, and M.E. Posner Parallel machine scheduling with high multiplicity Mathematical Programming 89 2001 359 383
4. S.S. Cosmadakis, and C.H. Papadimitriou The traveling salesman problem with many visits to few cities SIAM Journal on Computing 13 1984 99 108
5. H.A. Eiselt, M. Gendreau, and G. Laporte Arc routing problems, part i: The chinese postman problem Operations Research 43 1995 231 243
6. M.R. Garey, and D.S. Johnson Computers and Intractability: A Guide to the Theory of NP-Completeness 1979 Freeman and Company San Francisco
7. A. Grigoriev, High multiplicity scheduling problems, Doctoral Thesis, Maastricht University, Maastricht, Netherlands, 2003
8. D.S. Hochbaum, and R. Shamir Strongly polynomial algorithms for the high multiplicity scheduling problem Operations Research 39 1991 648 653
9. P. Kanellakis, and C.H. Papadimitriou Flow-shop scheduling with limited temporary storage Journal of the ACM 27 1980 533 549
10. J. Van de Klundert, A note on the high multiplicity traveling salesman problem, Working Paper, Maastricht University, Maastricht, Netherlands, 1995
11. H.W. Lenstra Jr. Integer programming with a fixed number of variables Mathematics of Operations Research 8 1983 538 547
12. G.L. Nemhauser, and L.A. Wolsey Integer and Combinatorial Optimization 1988 Wiley-Interscience Chichester
13. A. Schrijver Theory of Linear and Integer Programming 1986 Wiley-Interscience Chichester
14. J.A.A. Van der Veen, and S. Zhang Low-complexity algorithms for sequencing jobs with a fixed number of job-classes Computers And Operations Research 23 1996 1059 1067