The quickest path problem with interval lead times
type: Item
instance of: scholarly article
title: The quickest path problem with interval lead times
zbMATH Open document ID: 1057.90002
DOI: 10.1016/S0305-0548(02)00197-1
author: Herminia I. Calvete
published in: Computers \& Operations Research
publication date: 2005-02-23T00:00:00Z
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 2137514
MaRDI profile type: Publication
cites work: The quickest path problem
cites work: Distributed algorithms for the quickest path problem
cites work: Transmissions in a network with capacities and delays
cites work: Algorithms for the quickest path problem and the enumeration of quickest paths
cites work: An algorithm for finding the \(k\) quickest paths in a network
cites work: Algorithms for the constrained quickest path problem and the enumeration of quickest paths
cites work: Linear programming with interval coefficients
cites work: Technical Note—Exact Solutions of Inexact Linear Programs
cites work: Multiobjective programming in optimization of the interval objective function
cites work: Algorithms for Linear Programming Problems with Interval Objective Function Coefficients
cites work: Q3345690
cites work: Q5566070
cites work: Q3815146
cites work: Multiobjective programming in optimization of interval objective functions -- a generalized approach
cites work: An empirical investigation of some bicriterion shortest path algorithms
cites work: Q3888874
cites work: Q1095877
cites work: A label correcting approach for solving bicriterion shortest-path problems
cites work: Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems
description: scientific article; zbMATH DE number 2137514