Solving the traveling salesman problem with time windows through dynamically generated time-expanded networks
type: Item
instance of: scholarly article
title: Solving the traveling salesman problem with time windows through dynamically generated time-expanded networks
zbMATH Open document ID: 1492.90145
DOI: 10.1007/978-3-319-59776-8_21
author: Natashia Boland
author: Mike Hewitt
author: Duc Minh Vu
author: Martin W. P. Savelsbergh
publication date: 2017-08-04T00:00:00Z
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 6756591
zbMATH Keywords: traveling salesman problem
zbMATH Keywords: time windows
zbMATH Keywords: time-expanded networks
zbMATH Keywords: mixed integer programming
zbMATH Keywords: dynamic discretization discovery
describes a project that uses: TSPTW
MaRDI profile type: MaRDI publication profile
full work available at URL: 978-3-319-59776-8 21
OpenAlex ID: W2620179678
cites work: A polyhedral study of the asymmetric traveling salesman problem with time windows
cites work: New state-space relaxations for solving the traveling salesman problem with time windows
cites work: A time bucket formulation for the traveling salesman problem with time windows
cites work: An Optimal Algorithm for the Traveling Salesman Problem with Time Windows
cites work: A hybrid exact algorithm for the TSPTW
cites work: An exact constraint logic programming algorithm for the traveling salesman problem with time windows
cites work: The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
cites work: A general VNS heuristic for the traveling salesman problem with time windows
description: scientific article; zbMATH DE number 6756591