Pages that link to "Item:Q1317475"

The following pages link to Tight bounds on the number of minimum-mean cycle cancellations and related results (Q1317475):

Displaying 9 items.

• About the minimum mean cycle-canceling algorithm (Q499347) (← links)
• A strongly polynomial contraction-expansion algorithm for network flow problems (Q1652310) (← links)
• Decomposition theorems for linear programs (Q1785306) (← links)
• The minimum mean cycle-canceling algorithm for linear programs (Q2076908) (← links)
• A new approach for computing a most positive cut using the minimum flow algorithms (Q2493746) (← links)
• Smoothed Analysis of the Minimum-Mean Cycle Canceling Algorithm and the Network Simplex Algorithm (Q3196427) (← links)
• Smoothed Analysis of the Successive Shortest Path Algorithm (Q3457194) (← links)
• Engineering Negative Cycle Canceling for Wind Farm Cabling (Q5075800) (← links)
• Smoothed Analysis of the Minimum-Mean Cycle Canceling Algorithm and the Network Simplex Algorithm (Q5119385) (← links)