A bilevel programming approach to the travelling salesman problem.
type: Item
instance of: scholarly article
title: A bilevel programming approach to the travelling salesman problem.
zbMATH Open document ID: 1045.90052
author: P. Marcotte
author: Gilles Savard
author: F. Semet
published in: Operations Research Letters
publication date: 2004-03-15T00:00:00Z
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 2057196
zbMATH Keywords: Bilevel programming
zbMATH Keywords: Pricing
zbMATH Keywords: Travelling salesman problem
describes a project that uses: TSPLIB
MaRDI profile type: Publication
full work available at URL: j.orl.2003.08.005
OpenAlex ID: W2033097589
cites work: A New Formulation for the Travelling Salesman Problem
cites work: Solution of a Large-Scale Traveling-Salesman Problem
cites work: Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
cites work: The Traveling-Salesman Problem
cites work: A bilevel model of taxation and its application to optimal highway pricing
cites work: Classification of travelling salesman problem formulations
cites work: Q3677509
cites work: On Tightening the Relaxations of Miller-Tucker-Zemlin Formulations for Asymmetric Traveling Salesman Problems
DOI: 10.1016/J.ORL.2003.08.005
description: scientific article; zbMATH DE number 2057196