Pages that link to "Item:Q2643812"
From MaRDI portal
The following pages link to The robust minimum spanning tree problem: compact and convex uncertainty (Q2643812):
Displaying 3 items.
- Min-max and min-max regret versions of combinatorial optimization problems: A survey (Q1014933) (← links)
- A polynomial solvable minimum risk spanning tree problem with interval data (Q1027578) (← links)
- A fix‐and‐optimize heuristic for the minmax regret shortest path arborescence problem under interval uncertainty (Q6079879) (← links)
