An algorithm for linear programming which requires O(((m+n)n 2+(m+n)1.5 n)L) arithmetic operations-Reference-Cited by-同舟云学术

An algorithm for linear programming which requires O(((m+n)n 2+(m+n)1.5 n)L) arithmetic operations

Published:1990-05 Issue:1-3 Volume:47 Page:175-201
ISSN:0025-5610
Container-title:Mathematical Programming
language:en
Short-container-title:Mathematical Programming

Author:

Vaidya Pravin M.

Publisher

Springer Science and Business Media LLC

Subject

General Mathematics,Software

Link

http://link.springer.com/content/pdf/10.1007/BF01580859.pdf

Reference13 articles.

1. D.A. Bayer and J.C. Lagarias, “The non-linear geometry of linear programming I. Affine and projective scaling trajectories,”Transactions of the American Mathematical Society (1989), to appear.

2. J. Edmonds, “Systems of distinct representatives and linear algebra,”Journal of Research of the National Bureau of Standards 71B (1967) 241–245.

3. F.R. Gantmacher,Matrix Theory, Vol. 1 (Chelsea, London, 1959) Chapter 2.

4. C. Gonzaga, “An algorithm for solving linear programming problems in O(n 3 L) operations,” Memorandum UCB/ERL M87/10, Electronics Research Laboratory, University of Berkeley (Berkeley, CA, 1987).

5. N. Karmarkar, “A new polynomial time algorithm for linear programming,”Combinatorica 4 (1984) 373–395.

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

1. Inner Approximations of Reachable Sets for Nonlinear Systems Using the Minkowski Difference;IEEE Control Systems Letters;2024

2. Faster High Accuracy Multi-Commodity Flow from Single-Commodity Techniques;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06

3. Fully Dynamic Electrical Flows: Sparse Maxflow Faster Than Goldberg–Rao;SIAM Journal on Computing;2023-04-26

4. Fair Policy Targeting;Journal of the American Statistical Association;2023-01-09

5. DRIP: Domain Refinement Iteration With Polytopes for Backward Reachability Analysis of Neural Feedback Loops;IEEE Control Systems Letters;2023