[[1] Carutasu V., Consideraţii asupra fenomenului de ciclare în cazul problemei de programare liniară (LPP), Proceedings of the 24th International Conference „The Knowledge-Based Organization” of „Nicolae Bălcescu” Land Forces Academy, Sibiu, 14-16 June, 2018 - în curs de apariţie.]Search in Google Scholar
[[2] 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.]Search in Google Scholar
[[3] Hoffman AJ., Cycling in the simplex algorithm. Report 2974, Washington, DC: National Bureau of Standards: 1953.]Search in Google Scholar
[[4] Saul I. Gassa;∗, Sasirekha Vinjamurib, Cycling in linear programming problems, Computers & Operations Research 31 (2004) 303 - 311, Elsevier Ltd.10.1016/S0305-0548(02)00226-5]Search in Google Scholar
[[5] Zörnig P., Systematic construction of examples for cycling in the simplex method, Computers & Operations Research, 33 (2006), 2247-2262, Elsevier Ltd.10.1016/j.cor.2005.02.001]Search in Google Scholar
