A strongly polynomial algorithm for linear systems having a binary solution
From MaRDI portal
Publication:715067
DOI10.1007/S10107-011-0445-3zbMATH Open1268.90029OpenAlexW2020361255MaRDI QIDQ715067FDOQ715067
Publication date: 15 October 2012
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-011-0445-3
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
- A new polynomial-time algorithm for linear programming
- Title not available (Why is that?)
- The Relaxation Method for Linear Inequalities
- The Relaxation Method for Linear Inequalities
- The many facets of linear programming
- A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
- Systems of distinct representatives and linear algebra
Cited In (32)
- A polynomial-time descent method for separable convex optimization problems with linear constraints
- A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
- Rescaled Coordinate Descent Methods for Linear Programming
- Minimizing convex functions with rational minimizers
- Rescaling Algorithms for Linear Conic Feasibility
- Complete Algorithms for Algebraic Strongest Postconditions and Weakest Preconditions in Polynomial ODE’S
- A strongly polynomial algorithm for bimodular integer linear programming
- Computational performance of a projection and rescaling algorithm
- A polynomial projection algorithm for linear feasibility problems
- On Chubanov's Method for Linear Programming
- A note on submodular function minimization by Chubanov's LP algorithm
- Projection and Rescaling Algorithm for Finding Maximum Support Solutions to Polyhedral Conic Systems
- Sampling Kaczmarz-Motzkin method for linear feasibility problems: generalization and acceleration
- A simple method for convex optimization in the oracle model
- An efficient linearization technique for mixed 0-1 polynomial problem
- A deterministic rescaled perceptron algorithm
- Recent progress on the combinatorial diameter of polytopes and simplicial complexes
- An extension of Chubanov's polynomial-time linear programming algorithm to second-order cone programming
- A polynomial projection-type algorithm for linear programming
- Binary solutions to large systems of linear equations
- A simple method for convex optimization in the oracle model
- On Chubanov’s Method for Solving a Homogeneous Inequality System
- A strongly polynomial-time algorithm for the strict homogeneous linear-inequality feasibility problem
- Title not available (Why is that?)
- A Non-2-step Nilsystem With Linear Polynomial Complexity
- Solving conic systems via projection and rescaling
- A Sampling Kaczmarz--Motzkin Algorithm for Linear Feasibility
- A Computational Framework for Solving Nonlinear Binary Optimization Problems in Robust Causal Inference
- Comments on: Recent progress on the combinatorial diameter of polytopes and simplicial complexes
- A symmetry-based explanation of the main idea behind Chubanov's linear programming algorithm
- An extension of Chubanov's algorithm to symmetric cones
- A new extension of Chubanov's method to symmetric cones
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)
