A minmax regret version of the time-dependent shortest path problem
type: Item
instance of: scholarly article
title: A minmax regret version of the time-dependent shortest path problem
zbMATH Open document ID: 1403.90634
author: E. Conde
author: Marina Leal
author: Justo Puerto
published in: European Journal of Operational Research
publication date: 2018-07-25T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 6910062
zbMATH Keywords: integer programming
zbMATH Keywords: minmax-regret models
zbMATH Keywords: Benders decomposition
MaRDI profile type: Publication
full work available at URL: j.ejor.2018.04.030
OpenAlex ID: W2800486358
Wikidata QID: Q58217100
cites work: The time dependent traveling salesman problem: polyhedra and algorithm
cites work: Dynamic shortest paths minimizing travel times and costs
cites work: A survey of dynamic network flows
cites work: Interval data minmax regret network optimization problems
cites work: The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times
cites work: Models for railway track allocation
cites work: Nominal and robust train timetabling problems
cites work: Reduction approaches for robust shortest path problems
cites work: Shortest paths algorithms: Theory and experimental evaluation
cites work: A 2-approximation for minmax regret problems via a mid-point scenario optimal solution
cites work: On a constant factor approximation for minmax regret problems using a symmetry point scenario
cites work: The shortest route through a network with time-dependent internodal transit times
cites work: Ordered weighted average combinatorial optimization: formulations and their properties
cites work: Dynamic graph generation for the shortest path problem in time expanded networks
cites work: Time-dependent scheduling
cites work: Dynamic shortest path problems with time-varying costs
cites work: QoS guided min-min heuristic for grid task scheduling
cites work: Discrete optimization with interval data. Minmax regret and fuzzy approach
cites work: An approximation algorithm for interval data minmax regret combinatorial optimization problems
cites work: An exact algorithm for the robust shortest path problem with interval data
cites work: The robust shortest path problem with interval data via Benders decomposition
cites work: The robust set covering problem with interval data
cites work: Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems
cites work: The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling
cites work: The traveling salesman problem with time-dependent service times
cites work: Q4715981
DBLP publication ID: journals/eor/CondeLP18
DOI: 10.1016/J.EJOR.2018.04.030
Recommended article: A minimum expected regret model for the shortest path problem with solution-dependent probability distributions
Recommended article: The minmax regret robust shortest path problem in a finite multi-scenario model
Recommended article: Time-Dependent Shortest Path Problems with Penalties and Limits on Waiting
Recommended article: Minimax regret 1-median problem in dynamic path networks
Recommended article: Time‐dependent shortest paths with discounted waits
Recommended article: Plus court chemin avec dépendance horaire : résolution et application aux problèmes de tournées
Recommended article: An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem
Recommended article: A minmax regret approach to the critical path method with task interval times
Recommended article: A finite-time algorithm for shortest path problems with time-varying costs
description: scientific article; zbMATH DE number 6910062