Modifications and implementation of the ellipsoid algorithm for linear programming-Reference-Cited by-同舟云学术

Modifications and implementation of the ellipsoid algorithm for linear programming

Published:1982-12 Issue:1 Volume:23 Page:1-19
ISSN:0025-5610
Container-title:Mathematical Programming
language:en
Short-container-title:Mathematical Programming

Author:

Goldfarb Donald,Todd Michael J.

Publisher

Springer Science and Business Media LLC

Subject

General Mathematics,Software

Link

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

Reference32 articles.

1. S. Agmon, “The relaxation method for linear inequalities”,Canadian Journal of Mathematics 6 (1954) 382–392.

2. M.L. Balinski and P. Wolfe, eds.,Nondifferentiable optimization, Mathematical Programming Study 3 (North-Holland, Amsterdam, 1975).

3. J.M. Bennett, “Triangular factors of modified matrices”,Numerische Mathematik 7 (1965) 217–221.

4. R.G. Bland, D. Goldfarb and M.J. Todd, “The ellipsoid method: a survey”, Technical Report No. 476, School of Operations Research and Industrial Engineering, Cornell University, Ithaca, New York (1980).

5. Yu. M. Ermolev, “Methods of solution of nonlinear extremal problems”,Kibernetika 2 (4) (1966) 1–17. [Translated in:Cybernetics 2 (4) (1966), 1–14.]

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

1. A subgradient supported ellipsoid method for convex multiobjective optimization problems;OPSEARCH;2024-08-31

2. Efficient Version Space Algorithms for Human-in-the-loop Model Development;ACM Transactions on Knowledge Discovery from Data;2024-01-12

3. Ellipsoid Method;Encyclopedia of Optimization;2024

4. On Orchestration of Segment Routing and In-Band Network Telemetry;IEEE Transactions on Network and Service Management;2023-12

5. Kan Extensions are Partial Colimits;Applied Categorical Structures;2022-01-31