Pages that link to "Item:Q2744651"

The following pages link to A new?old algorithm for minimum-cut and maximum-flow in closure graphs (Q2744651):

Displaying 9 items.

• Production phase and ultimate pit limit design under commodity price uncertainty (Q320746) (← links)
• MineLib: a library of open pit mining problems (Q363555) (← links)
• Solving the parametric bipartite maximum flow problem in unbalanced and closure bipartite graphs (Q492813) (← links)
• Models and methods for solving the problem of network vulnerability (Q1951863) (← links)
• Enhanced instance space analysis for the maximum flow problem (Q2171589) (← links)
• A stable marriage requires communication (Q2278950) (← links)
• A combinatorial algorithm for weighted stable sets in bipartite graphs (Q2492214) (← links)
• The Parametric Closure Problem (Q3449830) (← links)
• Stackelberg Max Closure with Multiple Followers (Q5870364) (← links)