A polynomial projection algorithm for linear feasibility problems-Reference-Cited by-同舟云学术

A polynomial projection algorithm for linear feasibility problems

Published:2014-10-08 Issue:2 Volume:153 Page:687-713
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-014-0823-8.pdf

Reference16 articles.

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

2. Chubanov, S.: A strongly polynomial algorithm for linear systems having a binary solution. Math. Program. 134, 533–570 (2012)

3. Dantzig, G.: An $$\varepsilon $$ ε -precise feasible solution to a linear program with a convexity constraint in $$1/\varepsilon ^2$$ 1 / ε 2 iterations independent of problem size. Tech. rep. SOL 92–5 (1992)

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

5. Goffin, J.L.: The relaxation method for solving systems of linear inequalities. Math. Oper. Res. 5, 388–414 (1980)

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

1. The construction of multidimensional membership functions and its application to feasibility problems;Fuzzy Sets and Systems;2023-10

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

3. A New Algorithm for Linear Programming in Critical Systems;SN Computer Science;2022-12-01

4. Projection and Rescaling Algorithm for Finding Maximum Support Solutions to Polyhedral Conic Systems;Mathematics of Operations Research;2022-11

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