Pages that link to "Item:Q1373742"
From MaRDI portal
The following pages link to A new strongly polynomial dual network simplex algorithm (Q1373742):
Displaying 5 items.
- Exterior point simplex-type algorithms for linear and network optimization problems (Q492840) (← links)
- A polynomial time primal network simplex algorithm for minimum cost flows (Q1373741) (← 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)
- Diagnosing Infeasibility in Min-cast Network Flow Problems Part I: Dual Infeasibility (Q3833848) (← links)
