Towards a Genuinely Polynomial Algorithm for Linear Programming

Recommendations

A new polynomial-time algorithm for linear programming
scientific article; zbMATH DE number 4016589
Linear Time Algorithms for Two- and Three-Variable Linear Programs
An algorithm for linear programming which requires \(O(((m+n)n^ 2+(m+n)^{1.5}n)L)\) arithmetic operations
Linear Programming in Linear Time When the Dimension Is Fixed

Cited in

(47)

A strongly polynomial minimum cost circulation algorithm
Is binary encoding appropriate for the problem-language relationship?
Integer programs for logic constraint satisfaction
Testing the necklace condition for shortest tours and optimal factors in the plane
Locating service centers with precedence constraints
Algorithms and complexity analysis for some flow problems
Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality
New algorithms for generalized network flows
On the complexity of quadratic programming in real number models of computation
Polynomial algorithms for linear programming over the algebraic numbers
A class of polynomial variable metric algorithms for linear optimization
Some aspects of studying an optimization or decision problem in different computational models
The complexity of resource allocation and price mechanisms under bounded rationality
A linear programming primer: from Fourier to Karmarkar
Low-rank matrix approximation in the infinity norm
Range assignment of base-stations maximizing coverage area without interference
Bounds on the complexity of halfspace intersections when the bounded faces have small dimension
Detecting matrices of combinatorial rank three
A randomized polynomial-time simplex algorithm for linear programming
Synthesis for Polynomial Lasso Programs
A strongly polynomial algorithm for generalized flow maximization
Strongly polynomial algorithm for solving the general problem of least modules
Optimal Embedding into Star Metrics
scientific article; zbMATH DE number 4181141 (Why is no real title available?)
scientific article; zbMATH DE number 3978821 (Why is no real title available?)
scientific article; zbMATH DE number 14735 (Why is no real title available?)
scientific article; zbMATH DE number 4127000 (Why is no real title available?)
scientific article; zbMATH DE number 1083133 (Why is no real title available?)
scientific article; zbMATH DE number 4119927 (Why is no real title available?)
scientific article; zbMATH DE number 4121753 (Why is no real title available?)
A strongly polynomial algorithm for a new class of linear inequalities¹
Constraint satisfaction problems over numeric domains
On genuinely time bounded computations
Polynomial Programming: LP-Relaxations Also Converge
Minimizing mean weighted execution time loss on identical and uniform processors
A simple polynomial-time rescaling algorithm for solving linear programs
An efficient linearization technique for mixed 0-1 polynomial problem
A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix
A strongly polynomial algorithm for approximate Forster transforms and its application to halfspace learning
Minimizing convex functions with rational minimizers
A set partitioning reformulation of a school bus scheduling problem
Efficient algorithms for Lipschitz selections of set-valued mappings in \(\mathbf{R} 2\)
Polynomial algorithms for LP over a subring of the algebraic integers with applications to LP with circulant matrices
Combinatorial optimization. Abstracts from the workshop held November 10--15, 2024
A strongly polynomial algorithm for linear systems having a binary solution
A combinatorial certifying algorithm for linear programming problems with gainfree Leontief substitution systems
An algorithm of internal feasible directions for linear integer programming

This page was built for publication: Towards a Genuinely Polynomial Algorithm for Linear Programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3315270)