Polynomial algorithms for a class of linear programs
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3121293 (Why is no real title available?)
- scientific article; zbMATH DE number 3571502 (Why is no real title available?)
- scientific article; zbMATH DE number 3630144 (Why is no real title available?)
- Convergence rate of the gradient descent method with dilatation of the space
- Decomposition of regular matroids
- Integral Extreme Points
- Normal hypergraphs and the perfect graph conjecture
- Paths, Trees, and Flowers
- Systems of distinct representatives and linear algebra
- The Relaxation Method for Linear Inequalities
- The Relaxation Method for Linear Inequalities
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
Cited in
(10)- Projection algorithms for linear programming
- A sampling Kaczmarz-Motzkin algorithm for linear feasibility
- On Chubanov's Method for Linear Programming
- A decomposition property of polyhedra
- Proximal level bundle methods for convex nondifferentiable optimization, saddle-point problems and variational inequalities
- Sampling Kaczmarz-Motzkin method for linear feasibility problems: generalization and acceleration
- A comprehensive simplex-like algorithm for network optimization and perturbation analysis
- An appraisal of computational complexity for operations researchers
- Scaling: A general framework
- An exact and polynomial approach for a bi-objective integer programming problem regarding network flow routing
This page was built for publication: Polynomial algorithms for a class of linear programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4749597)
