Pages that link to "Item:Q1373742"
From MaRDI portal
The following pages link to A new strongly polynomial dual network simplex algorithm (Q1373742):
Displaying 18 items.
- Exterior point simplex-type algorithms for linear and network optimization problems (Q492840) (← links)
- Polynomial dual network simplex algorithms (Q689130) (← links)
- Two strongly polynomial cut cancelling algorithms for minimum cost network flow (Q689972) (← links)
- A warm-start dual simplex solution algorithm for the minimum flow networks with postoptimality analyses (Q699349) (← links)
- Polynomial-time primal simplex algorithms for the minimum cost network flow problem (Q1193519) (← links)
- Applying steepest-edge techniques to a network primal-dual algorithm (Q1362969) (← links)
- A polynomial time primal network simplex algorithm for minimum cost flows (Q1373741) (← links)
- Strongly polynomial dual simplex methods for the maximum flow problem (Q1380934) (← links)
- A new scaling algorithm for the minimum cost network flow problem (Q1970413) (← links)
- Exact and parameterized algorithms for read-once refutations in Horn constraint systems (Q2151419) (← links)
- Dynamic network flow location models and algorithms for quickest evacuation planning (Q2666700) (← links)
- An \(O(nm)\)-time network simplex algorithm for the shortest path problem (Q2770116) (← links)
- A new algorithm for finding the minimum cost flow using the duality principle (Q2886313) (← links)
- On a dual network exterior point simplex type algorithm and its computational behavior (Q3168430) (← links)
- A POLYNOMIAL-TIME DUAL SIMPLEX ALGORITHM FOR THE MINIMUM COST FLOW PROBLEM (Q3783057) (← links)
- Diagnosing Infeasibility in Min-cast Network Flow Problems Part I: Dual Infeasibility (Q3833848) (← links)
- (Q4352220) (← links)
- A polynomial dual simplex algorithm fot the generalized circulation problem. (Q5957566) (← links)
