Pages that link to "Item:Q881514"
From MaRDI portal
The following pages link to Minimax regret spanning arborescences under uncertain costs (Q881514):
Displaying 9 items.
- Maximising the worth of nascent networks (Q301061) (← links)
- On exact solutions for the minmax regret spanning tree problem (Q337033) (← links)
- Minmax regret bottleneck problems with solution-induced interval uncertainty structure (Q429655) (← links)
- A branch and bound algorithm for the minimax regret spanning arborescence (Q878227) (← links)
- Interval data minmax regret network optimization problems (Q1827805) (← links)
- Robustness of minimum cost arborescences (Q1926648) (← links)
- Algorithms for the minmax regret path problem with interval data (Q2198244) (← links)
- On a Class of Interval Data Minmax Regret CO Problems (Q5391890) (← links)
- A fix‐and‐optimize heuristic for the minmax regret shortest path arborescence problem under interval uncertainty (Q6079879) (← links)