Skip to Main content Skip to Navigation
Journal articles

On extended formulations for the precedence constrained asymmetric traveling salesman problem

Luís Gouveia 1 Pierre Pesneau 2, 3
3 Realopt - Reformulations based algorithms for Combinatorial Optimization
LaBRI - Laboratoire Bordelais de Recherche en Informatique, IMB - Institut de Mathématiques de Bordeaux, Inria Bordeaux - Sud-Ouest
Abstract : In this paper we study the use of formulations with precedence relation variables for the Precedence Constrained Asymmetric Travelling Salesman (PCATS) problem. Contrary to previous papers, the emphasis of this paper is on formulations involving exponential sized sets of inequalities and on the development of a cutting plane method together with polynomial routines for separating the new inequalities. Our computational results, taken from a set of benchmark instances, show that our methods improve significantly on most of the best previously known lower bound values.
Document type :
Journal articles
Complete list of metadata

https://hal.inria.fr/inria-00281586
Contributor : Pierre Pesneau Connect in order to contact the contributor
Submitted on : Tuesday, December 5, 2017 - 2:20:24 PM
Last modification on : Monday, June 14, 2021 - 9:56:01 AM

File

PCATSP_Article.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Luís Gouveia, Pierre Pesneau. On extended formulations for the precedence constrained asymmetric traveling salesman problem. Networks, Wiley, 2006, 48 (2), pp.77-89. ⟨10.1002/net.20122⟩. ⟨inria-00281586⟩

Share

Metrics

Record views

378

Files downloads

383