The Maximum Capacity Shortest Path Problem: Generation of Efficient Solution Sets

DOI10.1051/RO:2002002MaRDI QIDQ3148373zbMATH OpenOpenAlexFDO

Authors

Publication date 30 September 2002

Published in RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL http://www.numdam.org/item?id=RO_2002__36_1_1_0, http://www.numdam.org/item?id=RO_2002__36_1_1_0/, https://eudml.org/doc/245804

zbMATH Keywords

efficient solutionpath capacityquickest pathshortest path

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Communication networks in operations research (90B18)

Recommendations

• An algorithm for the quickest path problem
• A linear time algorithm for the maximum capacity path problem
• Algorithms for the quickest path problem and the reliable quickest path problem
• On the sum-max bicriterion path problem.
• The quickest path problem with batch constraints.

Cites work

• A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees
• A generalized permanent label setting algorithm for the shortest path between specified nodes
• A note on two problems in connexion with graphs
• 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
• Distributed algorithms for the quickest path problem
• Finding the \(k\) quickest simple paths in a network
• scientific article; zbMATH DE number 4085440 (Why is no real title available?)
• scientific article; zbMATH DE number 1900189 (Why is no real title available?)
• Implementation of algorithms forK shortest loopless paths
• Multiobjective programming and planning
• Multiobjective routing problems
• On the quickest path problem
• Shortest-Route Methods: 1. Reaching, Pruning, and Buckets
• The all-pairs quickest path problem
• The maximum covering/shortest path problem: A multiobjective network design and routing formulation
• The multichannel quickest-path problem
• The quickest path problem

Cited in

(9)

• On the sum-max bicriterion path problem.
• Sensitivity analysis for shortest path problems and maximum capacity path problems in undirected graphs
• Bounds and heuristics for the shortest capacitated paths problem
• A comprehensive survey on the quickest path problem
• Theory and application of reciprocal transformation of “path problem” and “time float problem”
• Multicriteria path and tree problems: discussion on exact algorithms and applications
• Maximum Capacity Path Interdiction Problem with Fixed Costs
• A linear time algorithm for the maximum capacity path problem
• The shortest multipaths problem in a capacitated dense channel

This page was built for publication: The Maximum Capacity Shortest Path Problem: Generation of Efficient Solution Sets

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