A classification of formulations for the (time-dependent) traveling salesman problem
type: Item
instance of: scholarly article
title: A classification of formulations for the (time-dependent) traveling salesman problem
zbMATH Open document ID: 0903.90170
DOI: 10.1016/0377-2217(93)E0238-S
author: Stefan Voß
author: Luis Gouveia
published in: European Journal of Operational Research
publication date: 1998-06-11T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C05
zbMATH DE Number: 1162955
zbMATH Keywords: time-dependent traveling salesman
zbMATH Keywords: classification of formulations
MaRDI profile type: Publication
cites work: The traveling salesman problem with cumulative costs
cites work: State-space relaxation procedures for the computation of bounds to routing problems
cites work: Solution of a Large-Scale Traveling-Salesman Problem
cites work: Q3747197
cites work: Technical Note—An n-Constraint Formulation of the (Time-Dependent) Traveling Salesman Problem
cites work: Validation of subgradient optimization
cites work: Classification of travelling salesman problem formulations
cites work: The quadratic assignment problem
cites work: Time‐dependent traveling salesman problem–the deliveryman case
cites work: An analytical comparison of different formulations of the travelling salesman problem
cites work: The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling
Recommended article: Classification of travelling salesman problem formulations
Recommended article: Natural and extended formulations for the time-dependent traveling salesman problem
Recommended article: Q4715981
Recommended article: The time-dependent traveling salesman problem
Recommended article: The time dependent traveling salesman problem: polyhedra and algorithm
Recommended article: A time bucket formulation for the traveling salesman problem with time windows
Recommended article: A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem
Recommended article: An integer programming approach for the time-dependent TSP
Recommended article: Facets and valid inequalities for the time-dependent travelling salesman problem
description: scientific article; zbMATH DE number 1162955