A strongly polynomial algorithm for linear systems having a binary solution
From MaRDI portal
Publication:715067
DOI10.1007/s10107-011-0445-3zbMath1268.90029OpenAlexW2020361255MaRDI QIDQ715067
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
Related Items (22)
A Computational Framework for Solving Nonlinear Binary Optimization Problems in Robust Causal Inference ⋮ Sampling Kaczmarz-Motzkin method for linear feasibility problems: generalization and acceleration ⋮ On Chubanov’s Method for Solving a Homogeneous Inequality System ⋮ Rescaled Coordinate Descent Methods for Linear Programming ⋮ A simple method for convex optimization in the oracle model ⋮ A polynomial projection-type algorithm for linear programming ⋮ Recent progress on the combinatorial diameter of polytopes and simplicial complexes ⋮ Solving conic systems via projection and rescaling ⋮ A new extension of Chubanov's method to symmetric cones ⋮ On Chubanov's Method for Linear Programming ⋮ Rescaling Algorithms for Linear Conic Feasibility ⋮ A Sampling Kaczmarz--Motzkin Algorithm for Linear Feasibility ⋮ An extension of Chubanov's algorithm to symmetric cones ⋮ A strongly polynomial-time algorithm for the strict homogeneous linear-inequality feasibility problem ⋮ An extension of Chubanov's polynomial-time linear programming algorithm to second-order cone programming ⋮ A note on submodular function minimization by Chubanov's LP algorithm ⋮ A deterministic rescaled perceptron algorithm ⋮ A Polynomial-Time Descent Method for Separable Convex Optimization Problems with Linear Constraints ⋮ Comments on: Recent progress on the combinatorial diameter of polytopes and simplicial complexes ⋮ A polynomial projection algorithm for linear feasibility problems ⋮ Computational performance of a projection and rescaling algorithm ⋮ Projection and Rescaling Algorithm for Finding Maximum Support Solutions to Polyhedral Conic Systems
Cites Work
- Unnamed Item
- A new polynomial-time algorithm for linear programming
- The many facets of linear programming
- A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
- Systems of distinct representatives and linear algebra
- The Relaxation Method for Linear Inequalities
- The Relaxation Method for Linear Inequalities
This page was built for publication: A strongly polynomial algorithm for linear systems having a binary solution
