Algorithms for the quickest path problem and the reliable quickest path problem
type: Item
instance of: scholarly article
title: Algorithms for the quickest path problem and the reliable quickest path problem
zbMATH Open document ID: 1273.90169
author: Herminia I. Calvete
author: Lourdes Del-Pozo
author: José A. Iranzo
published in: Computational Management Science
publication date: 2013-10-21T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90B10
zbMATH DE Number: 6217589
zbMATH Keywords: quickest path
zbMATH Keywords: reliability
zbMATH Keywords: recursive constraint
zbMATH Keywords: ranking quickest paths
describes a project that uses: NETGEN
MaRDI profile type: Publication
full work available at URL: s10287-012-0138-2
OpenAlex ID: W2028546357
cites work: Shortest chain subject to side constraints
cites work: The quickest path problem with interval lead times
cites work: The quickest path problem with batch constraints.
cites work: Algorithms for the constrained quickest path problem and the enumeration of quickest paths
cites work: Finding the \(k\) quickest simple paths in a network
cites work: The quickest path problem
cites work: NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
cites work: Q3048571
cites work: An algorithm for the quickest path problem
cites work: A label-setting algorithm for finding a quickest path
cites work: A comprehensive survey on the quickest path problem
cites work: Algorithms for the quickest path problem and the enumeration of quickest paths
cites work: Finding the K Shortest Loopless Paths in a Network
DOI: 10.1007/S10287-012-0138-2
description: scientific article; zbMATH DE number 6217589