A hybrid exact algorithm for the TSPTW
type: Item
instance of: scholarly article
zbMATH Open document ID: 1238.90054
author: Filippo Focacci
author: Andrea Lodi
author: Michela Milano
published in: INFORMS Journal on Computing
publication date: 2012-05-30T00:00:00Z
Mathematics Subject Classification ID: 90B30
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 68T20
Mathematics Subject Classification ID: 68N19
zbMATH DE Number: 6039096
zbMATH Keywords: routing
zbMATH Keywords: scheduling
zbMATH Keywords: relaxations
zbMATH Keywords: cutting planes
zbMATH Keywords: constraint programming
describes a project that uses: TSPTW
MaRDI profile type: Publication
OpenAlex ID: W2120365438
DOI: 10.1287/IJOC.14.4.403.2827
Recommended article: A hybrid algorithm for TSP
Recommended article: Q5455744
Recommended article: Q2770502
Recommended article: Q5319910
Recommended article: Q4471436
Recommended article: A hybrid exact algorithm for complete set partitioning
Recommended article: A new hybrid stochastic approximation algorithm
Recommended article: Q6060006
Recommended article: Q5077643
title: A hybrid exact algorithm for the TSPTW
description: scientific article; zbMATH DE number 6039096