Pages that link to "Item:Q2198244"
From MaRDI portal
The following pages link to Algorithms for the minmax regret path problem with interval data (Q2198244):
Displayed 4 items.
- An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem (Q486397) (← links)
- Distributionally robust bottleneck combinatorial problems: uncertainty quantification and robust decision making (Q2097653) (← links)
- Maximum excess dominance: identifying impractical solutions in linear problems with interval coefficients (Q2282559) (← links)
- A fix‐and‐optimize heuristic for the minmax regret shortest path arborescence problem under interval uncertainty (Q6079879) (← links)