Pages that link to "Item:Q4006338"

The following pages link to A Strongly Polynomial Algorithm for a Special Class of Linear Programs (Q4006338):

Displaying 18 items.

• A strongly polynomial algorithm for linear systems having a binary solution (Q715067) (← links)
• Bimonotone linear inequalities and sublattices of \(\mathbb R^n\) (Q817640) (← links)
• An efficient algorithm for solving a special class of LP's (Q1074311) (← links)
• New algorithms for generalized network flows (Q1332311) (← links)
• A simplex algorithm for a class of Leontief flow problems (Q1381763) (← 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)
• Gainfree Leontief substitution flow problems (Q1802953) (← links)
• A linear programming primer: from Fourier to Karmarkar (Q2177789) (← links)
• The simplex method using Tardos' basic algorithm is strongly polynomial for totally unimodular LP under nondegeneracy assumption (Q2829586) (← links)
• A Strongly Polynomial Algorithm for Generalized Flow Maximization (Q2976148) (← links)
• (Q4365450) (← links)
• An ε-Relaxation method for generalized separable convex cost network flow problems (Q4645915) (← links)
• A strongly polynomial algorithm for bimodular integer linear programming (Q4978060) (← links)
• Deepest point of a polyhedron and linear programming (Q4981863) (← links)
• A Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs (Q5002764) (← links)
• Complete Algorithms for Algebraic Strongest Postconditions and Weakest Preconditions in Polynomial ODE’S (Q5127191) (← links)
• Minimizing convex functions with rational minimizers (Q6567265) (← links)