A bilevel programming approach to the travelling salesman problem.

DOI10.1016/j.orl.2003.08.005zbMath1045.90052OpenAlexW2033097589MaRDI QIDQ1426728

Frédéric Semet, Patrice Marcotte, Gilles Savard

Publication date: 15 March 2004

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2003.08.005

zbMATH Keywords

PricingBilevel programmingTravelling salesman problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (5)

Bilevel Programming: The Montreal School ⋮ New formulations and valid inequalities for a bilevel pricing problem ⋮ An Objective Penalty Function Algorithm for Bilevel Programming Based on Multi-Parameters ⋮ An overview of bilevel optimization ⋮ Requiem for the Miller-Tucker-Zemlin subtour elimination constraints?

Uses Software

• TSPLIB

Cites Work

• Unnamed Item
• Classification of travelling salesman problem formulations
• Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
• A Bilevel Model of Taxation and Its Application to Optimal Highway Pricing
• A New Formulation for the Travelling Salesman Problem
• On Tightening the Relaxations of Miller-Tucker-Zemlin Formulations for Asymmetric Traveling Salesman Problems
• Solution of a Large-Scale Traveling-Salesman Problem
• The Traveling-Salesman Problem

This page was built for publication: A bilevel programming approach to the travelling salesman problem.