Pages that link to "Item:Q896121"

The following pages link to Improved algorithms for computing minmax regret sinks on dynamic path and tree networks (Q896121):

Displaying 2 items.

• Minimax regret 1-sink location problem with accessibility in dynamic general networks (Q322462) (← links)
• Multiple sink location problem in path networks with a combinational objective (Q828700) (← links)