Lagrangian relaxation for the multiple constrained robust shortest path problem

DOI10.1155/2019/3987278zbMath1435.90140OpenAlexW2954619438MaRDI QIDQ2298370

Publication date: 20 February 2020

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2019/3987278

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Related Items (1)

Corrigendum to: ``Lagrangian relaxation for the multiple constrained robust shortest path problem

Cites Work

Unnamed Item
Finding reliable shortest paths in road networks under uncertainty
The shortest-path problem with resource constraints with \((k, 2)\)-loop elimination and its application to the capacitated arc-routing problem
The constrained shortest path problem with stochastic correlated link travel times
On an exact method for the constrained shortest path problem
Reliability based assignment in stochastic-flow freight network
A Lagrangean heuristic for the capacitated concave minimum cost network flow problem
A three-stage approach for the resource-constrained shortest path as a sub-problem in column generation
A penalty function heuristic for the resource constrained shortest path problem
The shortest route problem with constraints
Models and algorithm for stochastic shortest path problem
Shortest Path Algorithms: An Evaluation Using Real Road Networks
Least Expected Time Paths in Stochastic, Time-Varying Transportation Networks
A survey of resource constrained shortest path problems: Exact solution approaches
Simultaneous solution of Lagrangean dual problems interleaved with preprocessing for the weight constrained shortest path problem
Lagrangian relaxation and enumeration for solving constrained shortest-path problems
Shortest chain subject to side constraints
An algorithm for the resource constrained shortest path problem
A dual algorithm for the constrained shortest path problem
A Mean-Variance Model for Route Guidance in Advanced Traveler Information Systems
Shortest Path Problems with Resource Constraints

This page was built for publication: Lagrangian relaxation for the multiple constrained robust shortest path problem