Systematic construction of examples for cycling in the simplex method-Reference-Cited by-同舟云学术

Systematic construction of examples for cycling in the simplex method

Published:2006-08 Issue:8 Volume:33 Page:2247-2262
ISSN:0305-0548
Container-title:Computers & Operations Research
language:en
Short-container-title:Computers & Operations Research

Author:

Zörnig Peter

Publisher

Elsevier BV

Subject

Management Science and Operations Research,Modelling and Simulation,General Computer Science

Reference35 articles.

1. Dantzig GB. Maximization of a linear function of variables subject to linear inequalities. In: Koopmans TC, editor. Activity analysis of production and allocation, New York, 1951.

2. Hoffman AJ. Cycling in the simplex algorithm. Report 2974, Washington, DC: National Bureau of Standards: 1953.

3. Making progress during a stall in the simplex algorithm;Dantzig;Linear Algebra and its Applications,1989

4. Survey of solved and open problems in the degeneracy phenomenon;Gal;Mathematical Programming Series B,1988

5. A new pivoting rule for solving various degeneracy problems;Gal;Operations Research Letters,1992

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

1. Aspects of the Cycling Phenomenon in the Linear Programming Problem (Lpp) Through the Example of Marshall and Suurballe;International conference KNOWLEDGE-BASED ORGANIZATION;2018-06-01

2. Considerations on Cycling in the Case of Linear Programming Problem (Lpp);International conference KNOWLEDGE-BASED ORGANIZATION;2018-06-01

3. Sparsity Prevention Pivoting Method for Linear Programming;IEEE Access;2018

4. Integral Simplex Methods for the Set Partitioning Problem: Globalisation and Anti-Cycling;Open Problems in Optimization and Data Analysis;2018

5. Constructing Cycles in the Simplex Method for DPLL(T);Theoretical Aspects of Computing – ICTAC 2017;2017