Pages that link to "Item:Q4006338"
From MaRDI portal
The following pages link to A Strongly Polynomial Algorithm for a Special Class of Linear Programs (Q4006338):
Displaying 8 items.
- Bimonotone linear inequalities and sublattices of \(\mathbb R^n\) (Q817640) (← links)
- New algorithms for generalized network flows (Q1332311) (← links)
- Monotonizing linear programs with up to two nonzeroes per column (Q1433661) (← links)
- Reformulation of the linear program for completely ergodic MDPs with average cost criteria (Q1676496) (← links)
- A linear programming primer: from Fourier to Karmarkar (Q2177789) (← links)
- A Strongly Polynomial Algorithm for Generalized Flow Maximization (Q2976148) (← links)
- An ε-Relaxation method for generalized separable convex cost network flow problems (Q4645915) (← links)
- Deepest point of a polyhedron and linear programming (Q4981863) (← links)
