A strongly polynomial algorithm for linear systems having a binary solution-Reference-Cited by-同舟云学术

A strongly polynomial algorithm for linear systems having a binary solution

Published:2011-02-27 Issue:2 Volume:134 Page:533-570
ISSN:0025-5610
Container-title:Mathematical Programming
language:en
Short-container-title:Math. Program.

Author:

Chubanov Sergei

Publisher

Springer Science and Business Media LLC

Subject

General Mathematics,Software

Link

http://link.springer.com/content/pdf/10.1007/s10107-011-0445-3.pdf

Reference8 articles.

1. Agmon Sh.: The relaxation method for linear inequalities. Can. J. Math. 6, 382–392 (1954)

2. Chubanov, S.: A polynomial relaxation-type algorithm for linear programming. http://www.optimization-online.org/DB_HTML/2011/02/2915.html (2010)

3. Edmonds J.: Systems of distinct representatives and linear algebra. J. Res. Nat. Bur. Standards 71B, 241–245 (1967)

4. Karmarkar N.: A new polynomial-time algorithm for linear programming. Combinatorica 4, 353–395 (1984)

5. Khachiyan, L.G.: A polynomial algorithm in linear programming. Dokl. Akad. Nauk SSSR 244 (English translation: Soviet Math. Dokl. 20, 191–194) (1979)

Cited by 28 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A simple method for convex optimization in the oracle model;Mathematical Programming;2023-08-10

2. A new extension of Chubanov’s method to symmetric cones;Mathematical Programming;2023-07-18

3. A two-step sub-optimal algorithm for bus evacuation planning;Operational Research;2023-05-31

4. Minimizing Convex Functions with Rational Minimizers;Journal of the ACM;2022-12-19

5. A Computational Framework for Solving Nonlinear Binary Optimization Problems in Robust Causal Inference;INFORMS Journal on Computing;2022-11