Pages that link to "Item:Q1176566"

The following pages link to Use of dynamic trees in a network simplex algorithm for the maximum flow problem (Q1176566):

Displaying 17 items.

• A polynomial-time simplex method for the maximum \(k\)-flow problem (Q688924) (← links)
• Polynomial dual network simplex algorithms (Q689130) (← links)
• A primal simplex algorithm that solves the maximum flow problem in at most nm pivots and \(O(n^ 2m)\) time (Q750277) (← links)
• An exterior simplex type algorithm for the minimum cost network flow problem (Q958451) (← links)
• On strongly polynomial variants of the networks simplex algorithm for the maximum flow problem (Q1180817) (← links)
• Polynomial-time primal simplex algorithms for the minimum cost network flow problem (Q1193519) (← links)
• Computational investigations of maximum flow algorithms (Q1278652) (← links)
• On the maximum capacity augmentation algorithm for the maximum flow problem (Q1314319) (← links)
• Equivalence of the primal and dual simplex algorithms for the maximum flow problem (Q1362513) (← links)
• A polynomial time primal network simplex algorithm for minimum cost flows (Q1373741) (← links)
• On strongly polynomial dual simplex algorithms for the maximum flow problem (Q1373745) (← links)
• Dynamic trees as search trees via Euler tours, applied to the network simplex algorithm (Q1373746) (← links)
• Strongly polynomial dual simplex methods for the maximum flow problem (Q1380934) (← links)
• Maximum flow problem in wireless ad hoc networks with directional antennas (Q2458905) (← links)
• (Q4488857) (← links)
• A comprehensive simplex-like algorithm for network optimization and perturbation analysis (Q4764598) (← links)
• A Friendly Smoothed Analysis of the Simplex Method (Q5129232) (← links)