Pages that link to "Item:Q3731344"

The following pages link to A capacity-rounding algorithm for the minimum-cost circulation problem: A dual framework of the Tardos algorithm (Q3731344):

Displaying 10 items.

• About the minimum mean cycle-canceling algorithm (Q499347) (← links)
• A dual version of Tardos's algorithm for linear programming (Q581226) (← links)
• Two strongly polynomial cut cancelling algorithms for minimum cost network flow (Q689972) (← links)
• An application of simultaneous diophantine approximation in combinatorial optimization (Q1101013) (← links)
• The minimal average cost flow problem (Q1130071) (← links)
• A fully combinatorial algorithm for submodular function minimization. (Q1850585) (← links)
• Personal reminiscence: combinatorial and discrete optimization problems in which I have been interested (Q1926640) (← links)
• A Push/Relabel framework for submodular flows and its definement for 0-1 submodular flows (Q2785397) (← links)
• Minimum-cost flow algorithms: an experimental evaluation (Q2943810) (← links)
• A survey on exact algorithms for the maximum flow and minimum‐cost flow problems (Q6139374) (← links)