The quickest path problem with interval lead times

DOI10.1016/S0305-0548(02)00197-1MaRDI QIDQ1765546zbMATH OpenFDO

Authors Herminia I. Calvete

Publication date 23 February 2005

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0305-0548(02)00197-1

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)

Recommendations

• The quickest path problem
• An algorithm for the quickest path problem
• On the quickest path problem
• MIN-MAX quickest path problems
• The all-pairs quickest path problem

Cites work

• A label correcting approach for solving bicriterion shortest-path problems
• Algorithms for Linear Programming Problems with Interval Objective Function Coefficients
• Algorithms for the constrained quickest path problem and the enumeration of quickest paths
• Algorithms for the quickest path problem and the enumeration of quickest paths
• An algorithm for finding the \(k\) quickest paths in a network
• An empirical investigation of some bicriterion shortest path algorithms
• Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems
• Distributed algorithms for the quickest path problem
• scientific article; zbMATH DE number 3880009 (Why is no real title available?)
• scientific article; zbMATH DE number 4085440 (Why is no real title available?)
• scientific article; zbMATH DE number 3694968 (Why is no real title available?)
• scientific article; zbMATH DE number 3281219 (Why is no real title available?)
• Linear programming with interval coefficients
• Multiobjective programming in optimization of interval objective functions -- a generalized approach
• Multiobjective programming in optimization of the interval objective function
• Recent advances and historical development of vector optimization. Proceedings of an International Conference on Vector Optimization Held at the Technical University of Darmstadt, FRG, August 4-7, 1986
• Technical Note—Exact Solutions of Inexact Linear Programs
• The quickest path problem
• Transmissions in a network with capacities and delays

Cited in

(8)

• A new model for path planning with interval data
• Dealing with residual energy when transmitting data in energy-constrained capacitated networks
• A comprehensive survey on the quickest path problem
• Fast and fine quickest path algorithm
• An efficient alternative to the exact evaluation of the quickest path flow network reliability problem
• Algorithms for the quickest path problem and the reliable quickest path problem
• Distributionally robust chance-constrained multicommodity network flow problem in dynamic networks: a column-generation approach
• A Monte Carlo-based algorithm for the quickest path flow network reliability problem

This page was built for publication: The quickest path problem with interval lead times

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1765546)