The constrained shortest path problem

DOI10.1002/NAV.3800250314MaRDI QIDQ4175067zbMATH OpenOpenAlexFDO

Authors K. P. K. Nair, Y. P. Aneja

Publication date 1978

Published in Naval Research Logistics Quarterly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/nav.3800250314

zbMATH Keywords

AlgorithmNetwork ProgrammingParametric ApproachCombinatorial ProblemConstrained Shortest Path Problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35)

Cites work

• Linear multiobjective programming

Cited in

(7)

• Pricing filtering in Dantzig-Wolfe decomposition
• An algorithm for the ranking of shortest paths
• On the sum-max bicriterion path problem.
• Applications of the parametric programming procedure
• Complexity analysis and optimization of the shortest path tour problem
• Network reduction for the acyclic constrained shortest path problem
• Bi-criteria path problem with minimum length and maximum survival probability

This page was built for publication: The constrained shortest path problem

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