A bilevel programming approach to the travelling salesman problem

Operations Research Letters

Volumn 32, Issue 3, 2004, Pages 240-248

  Marcotte, Patrice ^a   Savard, Gilles ^b   Semet, Frédéric ^c  

^a UNIVERSITÉ DE MONTRÉAL   (Canada)

^b GERAD   (Canada)

^c UNIVERSITÉ DE VALENCIENNES   (France)

Author keywords

Bilevel programming; Pricing; Travelling salesman problem

Indexed keywords

CONSTRAINT THEORY; GRAPH THEORY; LINEAR PROGRAMMING; MATHEMATICAL MODELS;

BILEVEL PROGRAMMING; MATHEMATICAL RELAXATIONS;

TRAVELING SALESMAN PROBLEM;

EID: 0346910306     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.orl.2003.08.005     Document Type: Article

References (11)

1. Claus A. A new formulation for the travelling salesman problem. SIAM J. Algebraic Discrete Methods. 5:1984;21-25.
2. Dantzig G.B., Fulkerson D.R., Johnson S.M. Solution of a large-scale traveling salesman problem. Oper. Res. 2:1954;393-410.
3. Desrochers M., Laporte G. Improvements and extensions to the Miller-Tucker-Zemlin subtour elimination constraints. Oper. Res. Lett. 10:1991;27-36.
4. Driscoll P.J. A new hierarchy of relaxation for 0-1 mixed integer problems with application to some specially structure problems, Doctoral Dissertation, Department of Industrial and Systems Engineering. 1995;Virginia Tech, Blacksburg, Virginia.
5. Flood M.M. The traveling salesman problem. Oper. Res. 4:1956;61-75.
6. Labbé M., Marcotte P., Savard G. A bilevel model of taxation and its application to optimal highway pricing. Management Sci. 44:1998;1608-1622.
7. Langevin A., Soumis F., Desrosiers J. Classification of travelling salesman problem formulations. Oper. Res. Lett. 9:1990;127-132.
8. E.L Lawler, J.K. Lenstra, A.H.G. Rinnoy Kan, D.B. Shmoys (Eds.), The traveling salesman problem. A Guided Tour of Combinatorial Optimization, Wiley, Toronto, 1985.
9. TSPLIB, Library of traveling salesman problems; www.iwr.uni-heidelberg.de/groups/comopt/software/TSPLIB95 .
10. Sherali H.D., Driscoll P.J. On tightening the relaxations of Miller-Tucker-Zemlin formulations for asymmetric traveling salesman problem. Oper. Res. 50:2002;656-659.
11. R.T. Wong, Integer programming formulation of the travelling salesman problem, Proc. IEEE Internat. Conf. Circuits Comput. (1980) 149-152.