Minimum time paths in a network with mixed time constraints.
type: Item
instance of: scholarly article
title: Minimum time paths in a network with mixed time constraints.
zbMATH Open document ID: 1040.90505
DOI: 10.1016/S0305-0548(98)00020-3
author: Kwei Tang
author: Yen-Liang Chen
published in: Computers \& Operations Research
publication date: 2003-09-07T00:00:00Z
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 1975801
MaRDI profile type: Publication
cites work: Shortest-path algorithms: Taxonomy and annotation
cites work: Shortest Route Models for the Allocation of Inspection Effort on a Production Line
cites work: Deterministic network optimization: A bibliography
cites work: Routing with time windows by column generation
cites work: A Generalized Permanent Labelling Algorithm For The Shortest Path Problem With Time Windows
cites work: A reoptimization algorithm for the shortest path problem with time windows
cites work: Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
cites work: A note on two problems in connexion with graphs
full work available at URL: s0305-0548(98)00020-3
OpenAlex ID: W2067736810
description: scientific article; zbMATH DE number 1975801