Pages that link to "Item:Q878227"
From MaRDI portal
The following pages link to A branch and bound algorithm for the minimax regret spanning arborescence (Q878227):
Displaying 6 items.
- On exact solutions for the minmax regret spanning tree problem (Q337033) (← links)
- A linear time algorithm for computing minmax regret 1-median on a tree network (Q486974) (← links)
- Minimax regret spanning arborescences under uncertain costs (Q881514) (← links)
- A Linear Time Algorithm for Computing Minmax Regret 1-Median on a Tree (Q2914306) (← links)
- A fix‐and‐optimize heuristic for the minmax regret shortest path arborescence problem under interval uncertainty (Q6079879) (← links)
- Fix-and-optimize metaheuristics for minmax regret binary integer programming problems under interval uncertainty (Q6186579) (← links)