A minmax regret version of the time-dependent shortest path problem

DOI10.1016/j.ejor.2018.04.030zbMath1403.90634OpenAlexW2800486358WikidataQ58217100 ScholiaQ58217100MaRDI QIDQ724002

Marina Leal, Eduardo Conde, Justo Puerto

Publication date: 25 July 2018

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2018.04.030

zbMATH Keywords

integer programmingBenders decompositionminmax-regret models

Mathematics Subject Classification ID

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

Related Items (6)

Minmax regret maximal covering location problems with edge demands ⋮ A robust optimization model for distribution network design under a mixed integer set of scenarios ⋮ Mathematical optimization models for reallocating and sharing health equipment in pandemic situations ⋮ Maximum excess dominance: identifying impractical solutions in linear problems with interval coefficients ⋮ Shortest paths with ordinal weights ⋮ The impacts of retailers' regret aversion on a random multi-period supply chain network

Cites Work

• Unnamed Item
• The traveling salesman problem with time-dependent service times
• The robust set covering problem with interval data
• On a constant factor approximation for minmax regret problems using a symmetry point scenario
• Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems
• Reduction approaches for robust shortest path problems
• Dynamic shortest path problems with time-varying costs
• A survey of dynamic network flows
• Discrete optimization with interval data. Minmax regret and fuzzy approach
• Time-dependent scheduling
• The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times
• A 2-approximation for minmax regret problems via a mid-point scenario optimal solution
• An approximation algorithm for interval data minmax regret combinatorial optimization problems
• QoS guided min-min heuristic for grid task scheduling
• Interval data minmax regret network optimization problems
• An exact algorithm for the robust shortest path problem with interval data
• Shortest paths algorithms: Theory and experimental evaluation
• Nominal and robust train timetabling problems
• The time dependent traveling salesman problem: polyhedra and algorithm
• Dynamic graph generation for the shortest path problem in time expanded networks
• Ordered weighted average combinatorial optimization: formulations and their properties
• The robust shortest path problem with interval data via Benders decomposition
• The shortest route through a network with time-dependent internodal transit times
• Models for Railway Track Allocation
• The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling
• Dynamic shortest paths minimizing travel times and costs

This page was built for publication: A minmax regret version of the time-dependent shortest path problem