A minmax regret version of the time-dependent shortest path problem
From MaRDI portal
Recommendations
- A minimum expected regret model for the shortest path problem with solution-dependent probability distributions
- The minmax regret robust shortest path problem in a finite multi-scenario model
- Time-dependent shortest path problems with penalties and limits on waiting
- Time-dependent shortest paths with discounted waits
- Plus court chemin avec dépendance horaire : résolution et application aux problèmes de tournées
- An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem
- A minmax regret approach to the critical path method with task interval times
- A finite-time algorithm for shortest path problems with time-varying costs
Cites work
- A 2-approximation for minmax regret problems via a mid-point scenario optimal solution
- A survey of dynamic network flows
- An approximation algorithm for interval data minmax regret combinatorial optimization problems
- An exact algorithm for the robust shortest path problem with interval data
- Discrete optimization with interval data. Minmax regret and fuzzy approach
- Dynamic graph generation for the shortest path problem in time expanded networks
- Dynamic shortest path problems with time-varying costs
- Dynamic shortest paths minimizing travel times and costs
- Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems
- scientific article; zbMATH DE number 947471 (Why is no real title available?)
- Interval data minmax regret network optimization problems
- Models for railway track allocation
- Nominal and robust train timetabling problems
- On a constant factor approximation for minmax regret problems using a symmetry point scenario
- Ordered weighted average combinatorial optimization: formulations and their properties
- QoS guided min-min heuristic for grid task scheduling
- Reduction approaches for robust shortest path problems
- Shortest paths algorithms: Theory and experimental evaluation
- The robust set covering problem with interval data
- The robust shortest path problem with interval data via Benders decomposition
- The shortest route through a network with time-dependent internodal transit times
- The time dependent traveling salesman problem: polyhedra and algorithm
- The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling
- The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times
- The traveling salesman problem with time-dependent service times
- Time-dependent scheduling
Cited in
(8)- A minimum expected regret model for the shortest path problem with solution-dependent probability distributions
- Erratum to: ``An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem
- The impacts of retailers' regret aversion on a random multi-period supply chain network
- Maximum excess dominance: identifying impractical solutions in linear problems with interval coefficients
- Shortest paths with ordinal weights
- 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
This page was built for publication: A minmax regret version of the time-dependent shortest path problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q724002)
