Robust constrained shortest path problems under budgeted uncertainty

DOI10.1002/net.21615zbMath1387.90255OpenAlexW1589941033WikidataQ58921048 ScholiaQ58921048MaRDI QIDQ4642442

Artur Alves Pessoa, Luigi Di Puglia Pugliese, Michael Poss, Francesca Guerriero

Publication date: 23 May 2018

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.21615

zbMATH Keywords

dynamic programmingrobust optimizationtime windows\(\mathcal{NP}\)-hardbudgeted uncertaintylabel-setting algorithmconstrained shortest path

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Dynamic programming (90C39)

Related Items (15)

Robust combinatorial optimization with locally budgeted uncertainty ⋮ Exact approaches to the robust vehicle routing problem with time windows and multiple deliverymen ⋮ Robust scheduling with budgeted uncertainty ⋮ A single representative min-max-min robust selection problem with alternatives and budgeted uncertainty ⋮ The robust vehicle routing problem with time windows: solution by branch and price and cut ⋮ Shortest path network problems with stochastic arc weights ⋮ The resource constrained shortest path problem with uncertain data: a robust formulation and optimal solution approach ⋮ Shortest path tour problem with time windows ⋮ Exact algorithms for the chance-constrained vehicle routing problem ⋮ A Dynamic Programming Approach for a Class of Robust Optimization Problems ⋮ A generalized shortest path tour problem with time windows ⋮ The continuous maximum capacity path interdiction problem ⋮ Robust drone selective routing in humanitarian transportation network assessment ⋮ Approximation algorithms for cost-robust discrete minimization problems based on their LP-relaxations ⋮ Robust vehicle routing under uncertainty via branch-price-and-cut

This page was built for publication: Robust constrained shortest path problems under budgeted uncertainty