Solving min-max shortest-path problems on a network

DOI<669::AID-NAV3220390506>3.0.CO;2-W 10.1002/1520-6750(199208)39:5<669::AID-NAV3220390506>3.0.CO;2-WzbMath0761.90095OpenAlexW2155090062MaRDI QIDQ4018281

Shenq-Shyong Her, Ishwar Murthy

Publication date: 16 January 1993

Full work available at URL: https://doi.org/10.1002/1520-6750(199208)39:5<669::aid-nav3220390506>3.0.co;2-w

zbMATH Keywords

pruningroutinglabel-correcting proceduremultiobjective shortest-path problems

Mathematics Subject Classification ID

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

Related Items (14)

Solving biobjective combinatorial max-ordering problems by ranking methods and a two-phases approach ⋮ The minmax regret robust shortest path problem in a finite multi-scenario model ⋮ A decision-theoretic approach to robust optimization in multivalued graphs ⋮ Selected Multicriteria Shortest Path Problems: An Analysis of Complexity, Models and Adaptation of Standard Algorithms ⋮ An augmented weighted Tchebycheff method with adaptively chosen parameters for discrete bicriteria optimization problems ⋮ Choquet-based optimisation in multiobjective shortest path and spanning tree problems ⋮ Norm-based approximation in multicriteria programming. ⋮ Min-ordering and max-ordering scalarization methods for multi-objective robust optimization ⋮ Shortest path network problems with stochastic arc weights ⋮ Dynamic preprocessing for the minmax regret robust shortest path problem with finite multi-scenarios ⋮ Parameterized complexity of spare capacity allocation and the multicost Steiner subgraph problem ⋮ Multicriteria adaptive paths in stochastic, time-varying networks ⋮ Extensions of labeling algorithms for multi‐objective uncertain shortest path problems ⋮ Exact algorithms for the stochastic shortest path problem with a decreasing deadline utility function

Cites Work

• Unnamed Item
• Feedback Stabilization of Linear Diffusion Systems
• 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

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