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