Pages that link to "Item:Q724002"
From MaRDI portal
The following pages link to A minmax regret version of the time-dependent shortest path problem (Q724002):
Displaying 9 items.
- Minimax regret 1-median problem in dynamic path networks (Q726099) (← links)
- A minimum expected regret model for the shortest path problem with solution-dependent probability distributions (Q1652010) (← links)
- Erratum to: ``An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem'' (Q1675565) (← links)
- The impacts of retailers' regret aversion on a random multi-period supply chain network (Q2086940) (← links)
- Maximum excess dominance: identifying impractical solutions in linear problems with interval coefficients (Q2282559) (← links)
- Shortest paths with ordinal weights (Q2327649) (← links)
- Minmax regret maximal covering location problems with edge demands (Q2668649) (← links)
- A robust optimization model for distribution network design under a mixed integer set of scenarios (Q2669596) (← links)
- Mathematical optimization models for reallocating and sharing health equipment in pandemic situations (Q6113556) (← links)
