The resource constrained shortest path problem with uncertain data: a robust formulation and optimal solution approach

DOI10.1016/j.cor.2019.03.010zbMath1458.90611OpenAlexW2923442889WikidataQ128174315 ScholiaQ128174315MaRDI QIDQ1738828

Michael Poss, Francesca Guerriero, Luigi Di Puglia Pugliese

Publication date: 18 April 2019

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2019.03.010

zbMATH Keywords

dynamic programmingrobust optimizationbudgeted uncertaintyconstrained shortest path

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Multi-objective and goal programming (90C29) Combinatorial optimization (90C27)

Related Items (9)

The last-mile delivery process with trucks and drones under uncertain energy consumption ⋮ A single representative min-max-min robust selection problem with alternatives and budgeted uncertainty ⋮ A directional heuristics pulse algorithm for a two resources constrained shortest path problem with reinitialization ⋮ Shortest path tour problem with time windows ⋮ Distributionally robust maximum probability shortest path problem ⋮ A generalized shortest path tour problem with time windows ⋮ Robust drone selective routing in humanitarian transportation network assessment ⋮ Branch-Cut-and-Price for the Robust Capacitated Vehicle Routing Problem with Knapsack Uncertainty ⋮ An exact reduction technique for the k-colour shortest path problem

Cites Work

• Unnamed Item
• Robust combinatorial optimization with variable cost uncertainty
• The constrained shortest path problem with stochastic correlated link travel times
• Exact solution of the robust knapsack problem
• On an exact method for the constrained shortest path problem
• The robust vehicle routing problem with time windows
• Constrained shortest path with uncertain transit times
• A robust approach to the chance-constrained knapsack problem
• Two engineering applications of a constrained shortest-path model
• Robust solutions of uncertain linear programs
• Robust discrete optimization and network flows
• Robust combinatorial optimization with knapsack uncertainty
• An enhanced K-SP algorithm with pruning strategies to solve the constrained shortest path problem
• Robust combinatorial optimization with variable budgeted uncertainty
• A short note on the robust combinatorial optimization problems with cardinality constrained uncertainty
• The robust crew pairing problem: model and solution methodology
• A note on the Bertsimas \& Sim algorithm for robust combinatorial optimization problems
• A survey of resource constrained shortest path problems: Exact solution approaches
• A Dynamic Programming Approach for a Class of Robust Optimization Problems
• The Robust Capacitated Vehicle Routing Problem Under Demand Uncertainty
• Optimization over Integers with Robustness in Cost and Few Constraints
• Recoverable Robust Knapsacks: Γ-Scenarios
• Lagrangian relaxation and enumeration for solving constrained shortest-path problems
• The Price of Robustness
• An algorithm for the resource constrained shortest path problem
• Improved preprocessing, labeling and scaling algorithms for the Weight-Constrained Shortest Path Problem
• Robust constrained shortest path problems under budgeted uncertainty
• Technical Note—Branch-and-Price-and-Cut Approach to the Robust Network Design Problem Without Flow Bifurcations
• Shortest path with time constraints on movement and parking

This page was built for publication: The resource constrained shortest path problem with uncertain data: a robust formulation and optimal solution approach