The time dependent traveling salesman problem: polyhedra and algorithm
type: Item
instance of: scholarly article
title: The time dependent traveling salesman problem: polyhedra and algorithm
zbMATH Open document ID: 1269.90064
author: Hernán G. Abeledo
author: Ricardo Fukasawa
author: Artur Alves Pessoa
author: Eduardo Uchoa
published in: Mathematical Programming Computation
publication date: 2013-04-12T00:00:00Z
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 6153542
zbMATH Keywords: integer programming
zbMATH Keywords: polyhedral combinatorics
zbMATH Keywords: cutting planes
zbMATH Keywords: branch-price-and-cut
zbMATH Keywords: time dependent traveling salesman
describes a project that uses: COIN/BCP
describes a project that uses: TSPLIB
describes a project that uses: CPLEX
describes a project that uses: Cliquer
MaRDI profile type: Publication
full work available at URL: s12532-012-0047-y
OpenAlex ID: W2080484716
cites work: On the solution of traveling salesman problems
cites work: New facets of the STS polytope generated from known facets of the ATS polytope
cites work: Q4461905
cites work: The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times
cites work: The Delivery Man Problem and Cumulative Matroids
cites work: Technical Note—An n-Constraint Formulation of the (Time-Dependent) Traveling Salesman Problem
cites work: A theorem on flows in networks
cites work: Hop-indexed circuit-based formulations for the traveling salesman problem
cites work: A classification of formulations for the (time-dependent) traveling salesman problem
cites work: Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs
cites work: On the symmetric travelling salesman problem II: Lifting theorems and facets
cites work: On Representatives of Subsets
cites work: Q3274170
cites work: The shortest-path problem with resource constraints and \(k\)-cycle elimination for \(k\geq 3\)
cites work: Time‐dependent traveling salesman problem–the deliveryman case
cites work: A new formulation for the traveling deliveryman problem
cites work: An integer programming approach for the time-dependent TSP
cites work: On the facial structure of set packing polyhedra
cites work: The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling
cites work: Robust Branch-Cut-and-Price Algorithms for Vehicle Routing Problems
cites work: A robust branch-cut-and-price algorithm for the heterogeneous fleet vehicle routing problem
cites work: Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems
cites work: Q3285992
cites work: Q4715981
DOI: 10.1007/S12532-012-0047-Y
description: scientific article; zbMATH DE number 6153542