Solving min-max shortest-path problems on a network

DOI10.1002/1520-6750(199208)39:5%3C669::AID-NAV3220390506%3E3.0.CO;2-WMaRDI QIDQ4018281zbMATH OpenOpenAlexFDO

Authors Ishwar Murthy, Shenq-Shyong Her

Publication date 16 January 1993

Full work available at URL https://doi.org/10.1002/1520-6750(199208)39:5%3C669::aid-nav3220390506%3E3.0.co;2-w

zbMATH Keywords

label-correcting proceduremultiobjective shortest-path problemspruningrouting

Mathematics Subject Classification ID

Computational methods for problems pertaining to operations research and mathematical programming (90-08) Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Programming involving graphs or networks (90C35)

Recommendations

• Label correcting methods to solve multicriteria shortest path problems
• The shortest path problem with two objective functions
• On a multicriteria shortest path problem
• On the minimax path in a network
• Martins' algorithm revisited for multi-objective shortest path problems with a MaxMin cost function

Cites work

• A Dynamic Programming Solution of the Large-Scale Single-Vehicle Dial-A-Ride Problem with Time Windows
• Algorithms for Scheduling Independent Tasks
• Exact and Approximate Algorithms for Scheduling Nonidentical Processors
• Feedback Stabilization of Linear Diffusion Systems
• scientific article; zbMATH DE number 51430 (Why is no real title available?)

Cited in

(27)

• Exact algorithms for the stochastic shortest path problem with a decreasing deadline utility function
• Norm-based approximation in multicriteria programming.
• Min-ordering and max-ordering scalarization methods for multi-objective robust optimization
• Dynamic preprocessing for the minmax regret robust shortest path problem with finite multi-scenarios
• Solving biobjective combinatorial max-ordering problems by ranking methods and a two-phases approach
• Shortest path network problems with stochastic arc weights
• Parameterized complexity of spare capacity allocation and the multicost Steiner subgraph problem
• A decision-theoretic approach to robust optimization in multivalued graphs
• Solving elementary shortest-path problems as mixed-integer programs
• Multicriteria adaptive paths in stochastic, time-varying networks
• Choquet-based optimisation in multiobjective shortest path and spanning tree problems
• The minmax regret robust shortest path problem in a finite multi-scenario model
• Minimax models for diverse routing
• scientific article; zbMATH DE number 6707504 (Why is no real title available?)
• scientific article; zbMATH DE number 1810469 (Why is no real title available?)
• An augmented weighted Tchebycheff method with adaptively chosen parameters for discrete bicriteria optimization problems
• scientific article; zbMATH DE number 3978796 (Why is no real title available?)
• On the minimax path in a network
• scientific article; zbMATH DE number 1382484 (Why is no real title available?)
• Extensions of labeling algorithms for multi-objective uncertain shortest path problems
• Selected Multicriteria Shortest Path Problems: An Analysis of Complexity, Models and Adaptation of Standard Algorithms
• On Some Special Network Flow Problems: The Shortest Path Tour Problems
• Global optimization: On pathlengths in min-max graphs
• Label correcting methods to solve multicriteria shortest path problems
• The cable trench problem: Combining the shortest path and minimum spanning tree problems
• Robust and distributionally robust shortest path problems: a survey
• Graph path minimization problem

This page was built for publication: Solving min-max shortest-path problems on a network

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