Pages that link to "Item:Q878227"

The following pages link to A branch and bound algorithm for the minimax regret spanning arborescence (Q878227):

Displaying 2 items.

• 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)