A branch \& cut algorithm for the asymmetric traveling salesman problem with precedence constraints
type: Item
instance of: scholarly article
title: A branch \& cut algorithm for the asymmetric traveling salesman problem with precedence constraints
zbMATH Open document ID: 1017.90095
DOI: 10.1023/A:1008779125567
author: Norbert Ascheuer
author: Michael Jünger
author: Gerhard Reinelt
published in: Computational Optimization and Applications
publication date: 2003-08-26T00:00:00Z
Mathematics Subject Classification ID: 90C29
Mathematics Subject Classification ID: 90C57
Mathematics Subject Classification ID: 90C10
zbMATH DE Number: 1540630
zbMATH Keywords: asymmetric traveling salesman problem
zbMATH Keywords: precedence constraints
zbMATH Keywords: branch \& cut
describes a project that uses: TSPLIB
MaRDI profile type: Publication
full work available at URL: a:1008779125567
OpenAlex ID: W2137045485
description: scientific article; zbMATH DE number 1540630