A strongly polynomial algorithm for linear systems having a binary solution
From MaRDI portal
(Redirected from Publication:715067)
Recommendations
- A strongly polynomial algorithm for a new class of linear inequalities1
- A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
- scientific article; zbMATH DE number 1161055
- Towards a Genuinely Polynomial Algorithm for Linear Programming
- A Strongly Polynomial Algorithm for a Special Class of Linear Programs
Cites work
- scientific article; zbMATH DE number 3644821 (Why is no real title available?)
- A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
- A new polynomial-time algorithm for linear programming
- Systems of distinct representatives and linear algebra
- The Relaxation Method for Linear Inequalities
- The Relaxation Method for Linear Inequalities
- The many facets of linear programming
Cited in
(35)- Comments on: Recent progress on the combinatorial diameter of polytopes and simplicial complexes
- Rescaling algorithms for linear conic feasibility
- A deterministic rescaled perceptron algorithm
- On Chubanov's Method for Linear Programming
- A note on submodular function minimization by Chubanov's LP algorithm
- A sampling Kaczmarz-Motzkin algorithm for linear feasibility
- A polynomial-time descent method for separable convex optimization problems with linear constraints
- Complete Algorithms for Algebraic Strongest Postconditions and Weakest Preconditions in Polynomial ODE’S
- A simple method for convex optimization in the oracle model
- scientific article; zbMATH DE number 3923955 (Why is no real title available?)
- Binary solutions to large systems of linear equations
- A strongly polynomial algorithm for bimodular integer linear programming
- Projection and Rescaling Algorithm for Finding Maximum Support Solutions to Polyhedral Conic Systems
- Recent progress on the combinatorial diameter of polytopes and simplicial complexes
- Strongly polynomial algorithm for solving the general problem of least modules
- A symmetry-based explanation of the main idea behind Chubanov's linear programming algorithm
- Computational performance of a projection and rescaling algorithm
- An extension of Chubanov's polynomial-time linear programming algorithm to second-order cone programming
- An efficient linearization technique for mixed 0-1 polynomial problem
- A polynomial projection algorithm for linear feasibility problems
- A Computational Framework for Solving Nonlinear Binary Optimization Problems in Robust Causal Inference
- A Non-2-step Nilsystem With Linear Polynomial Complexity
- A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
- Solving conic systems via projection and rescaling
- An extension of Chubanov's algorithm to symmetric cones
- Rescaled coordinate descent methods for linear programming
- On Chubanov's method for solving a homogeneous inequality system
- A new extension of Chubanov's method to symmetric cones
- Minimizing convex functions with rational minimizers
- A strongly polynomial-time algorithm for the strict homogeneous linear-inequality feasibility problem
- A Strongly Polynomial Algorithm for a Special Class of Linear Programs
- A polynomial projection-type algorithm for linear programming
- Sampling Kaczmarz-Motzkin method for linear feasibility problems: generalization and acceleration
- A simple method for convex optimization in the oracle model
- An algorithm for binary linear programming
This page was built for publication: A strongly polynomial algorithm for linear systems having a binary solution
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q715067)
