A Strongly Polynomial Algorithm for a Special Class of Linear Programs

DOI10.1287/opre.39.6.955zbMath0749.90048OpenAlexW2039394406MaRDI QIDQ4006338

Ilan Adler, Steven Cosares

Publication date: 26 September 1992

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/03c7de834783a0d9812c093af176eaceb85b2957

zbMATH Keywords

strongly polynomial timeLeontief substitution systemsgeneralized transshipment

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Linear programming (90C05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (8)

New algorithms for generalized network flows ⋮ A linear programming primer: from Fourier to Karmarkar ⋮ Reformulation of the linear program for completely ergodic MDPs with average cost criteria ⋮ A Strongly Polynomial Algorithm for Generalized Flow Maximization ⋮ Monotonizing linear programs with up to two nonzeroes per column ⋮ An ε-Relaxation method for generalized separable convex cost network flow problems ⋮ Deepest point of a polyhedron and linear programming ⋮ Bimonotone linear inequalities and sublattices of \(\mathbb R^n\)

This page was built for publication: A Strongly Polynomial Algorithm for a Special Class of Linear Programs