| Article ID: | iaor20043363 |
| Country: | Netherlands |
| Volume: | 32 |
| Issue: | 3 |
| Start Page Number: | 240 |
| End Page Number: | 248 |
| Publication Date: | May 2004 |
| Journal: | Operations Research Letters |
| Authors: | Marcotte Patrice, Semet Frdric, Savard Gilles |
We show that the travelling salesman problem is polynomially reducible to a bilevel toll optimization program. Based on natural bilevel programming techniques, we recover the lifted Miller–Tucker–Zemlin constraints. Next, we derive an O(