The asymmetric travelling salesman problem and a reformulation of the Miller-Tucker-Zemlin constraints
type: Item
instance of: scholarly article
title: The asymmetric travelling salesman problem and a reformulation of the Miller-Tucker-Zemlin constraints
zbMATH Open document ID: 0971.90099
DOI: 10.1016/S0377-2217(97)00358-5
author: Jose Manuel Pires
author: Luis Gouveia
published in: European Journal of Operational Research
publication date: 1999-12-20T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C10
zbMATH DE Number: 1358456
zbMATH Keywords: asymmetric travelling salesman problem
zbMATH Keywords: Miller-Tucker-Zemlin constraints
zbMATH Keywords: LP relaxation
MaRDI profile type: Publication
cites work: Q3056948
cites work: Solution of a Large-Scale Traveling-Salesman Problem
cites work: Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
cites work: Facets of the Asymmetric Traveling Salesman Polytope
cites work: A Polyhedral Approach to the Asymmetric Traveling Salesman Problem
cites work: A result on projection for the vehicle routing problem
cites work: Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with Hop constraints
cites work: Classification of travelling salesman problem formulations
cites work: Q5187226
cites work: Integer Programming Formulation of Traveling Salesman Problems
cites work: An analytical comparison of different formulations of the travelling salesman problem
cites work: Q3682240
full work available at URL: s0377-2217(97)00358-5
OpenAlex ID: W2092353499
Recommended article: The asymmetric travelling salesman problem: on generalizations of disaggregated Miller-Tucker-Zemlin constraints
Recommended article: On Tightening the Relaxations of Miller-Tucker-Zemlin Formulations for Asymmetric Traveling Salesman Problems
Recommended article: A Polyhedral Approach to the Asymmetric Traveling Salesman Problem
Recommended article: On extended formulations for the precedence constrained asymmetric traveling salesman problem
Recommended article: A note on the complexity of the asymmetric traveling salesman problem
Recommended article: The asymmetric m-travelling salesman problem: A duality based branch-and- bound algorithm
Recommended article: Transforming asymmetric into symmetric traveling salesman problems: Erratum
Recommended article: The asymmetric bottleneck traveling salesman problem: algorithms, complexity and empirical analysis
Recommended article: Q3002798
description: scientific article; zbMATH DE number 1358456