Using Gavish-Grave LP to formulate the directed black and white traveling salesman problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4489 LNCS, Issue PART 3, 2007, Pages 293-298

  Jiang, He ^a   Zhang, XianChao ^a   Li, MingChu ^a   Che, HaoYang ^b  

^a DALIAN UNIVERSITY OF TECHNOLOGY   (China)

^b INSTITUTE OF SOFTWARE   (China)

Author keywords

Black and white traveling salesman problem; Gavish Grave LP; Linear programming

Indexed keywords

COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; FIBER OPTIC NETWORKS; POLYNOMIALS; SCHEDULING; TRAVELING SALESMAN PROBLEM;

BLACK AND WHITE TRAVELING SALESMAN PROBLEM; CARDINALITY CONSTRAINTS; GAVISH-GRAVE LP;

LINEAR PROGRAMMING;

EID: 38149114152     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-72588-6_49     Document Type: Conference Paper

References (16)

1. Wasem OJ. An algorithm for designing rings in survivable fiber networks. IEEE Transactions on Reliability (1991) 40:428-32
2. Cosares S, Deutsch DN, Saniee I, Wasem OJ. SONET toolkit: a decision support system for designing robust and cost-effective fiber-optic networks. Interfaces (1995) 25(1):20-40
3. Talluri KT. The four-day aircraft maintenance routing problem. Transportation Science (1998) 32:43-53
4. Mak V, Boland N. Heuristic approaches to the asymmetric traveling salesman problem with replenishment arcs. International Transactions in Operation Research (2000) 7:431-47.
5. Orman AJ, Williams HP. A survey of different integer programming formulations of the travelling salesman problem. Working Paper No: LSEOR 04.67, The London School of Economics and Political Science (2004)
6. Dantzig GG, Fulkerson DR and Johnson SM. Solutions of a large scale traveling salesman problem. Operations. Research (1954) 2:393-410
7. Miller CE, Tucker AW and Zemlin RA. Integer programming formulation of traveling salesman problem. Journal of ACM (1960) 3:326-329
8. Gavish B and Graves SC. The traveling salesman problem and related problems. Working Paper OR-078-78, Operations Research Center, MIT, Cambridge, MA (1978)
9. Finke KR, Gavish B and Graves SC. A two-commodity network flow approach to the traveling salesman problem. Combinatorics, Graph Theory and Computing, Proc. 14th South Eastern Conf., Atlantic University, Florida (1983)
10. Wong RT. Integer programming formulations of the traveling salesman problem. Proc. IEEE Conf. On Circuits and Computers (1980) 149-152
11. Claus A. A new formulation for the traveling salesman problem. SIAM Journal of Algorithm and Discrete Mathematics (1984) 5:21-25
12. Vajda S. Mathematical Programming. Addison-Wesley, London (1961)
13. Fox KR, Gavish B and Graves SC. An n-constraint formulation of the (time-dependent) traveling salesman problem. Operations Research (1980) 28:1018-1021
14. Zhu, Z. The aircraft rotation problem. PhD thesis, Georgia Institute of Technology (1994)
15. Boland NL, Clarke LW, Nemhauser GL. The asymmetric traveling salesman problem with replenishment arcs. European Journal of Operations Research (2000) 123:408-427
16. Vicky M. On the asymmetric traveling salesman problem with replenishment arcs. Department of Mathematics and Statistics, University of Melbourne, PhD thesis (2000)