( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Finiteness of the quadratic primal simplex method when s-monotone index selection rules are applied.

, , и . Central Eur. J. Oper. Res., 26 (3): 535-550 (2018)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Géza Illéssy

Annemarie Illéssy

Annemarie Illéssy

Klaus Tiborski

Dirk Illesy

 

Другие публикации лиц с тем же именем

Market exchange models and geometric programming., , и . Central Eur. J. Oper. Res., 27 (2): 415-435 (2019)The s-monotone index selection rules for pivot algorithms of linear programming., , и . Eur. J. Oper. Res., 221 (3): 491-500 (2012)17th EURO Mini Conference "Continuous Optimization in the Industry", Pécs, Hungary, June 29-July 1, 2005., , , , и . Eur. J. Oper. Res., 191 (3): 771-772 (2008)A Mizuno-Todd-Ye type predictor-corrector algorithm for sufficient linear complementarity problems., и . Eur. J. Oper. Res., 181 (3): 1097-1111 (2007)A Strongly Polynomial Rounding Procedure Yielding a Maximally Complementary Solution for P*(kappa) Linear Complementarity Problems., , , и . SIAM J. Optimization, 11 (2): 320-340 (2000)EUROpt, the Continuous Optimization Working Group of EURO: From idea to maturity., и . EURO J. Comput. Optim., (2022)Large-step predictor-corrector interior point method for sufficient linear complementarity problems based on the algebraic equivalent transformation., , и . EURO J. Comput. Optim., (января 2023)Optimization of nuclear reactor reloading patterns., , , , , , и . Ann. Oper. Res., (1997)Anstreicher-Terlaky type monotonic simplex algorithms for linear feasibility problems., , и . Optim. Methods Softw., 22 (4): 679-695 (2007)A polynomial path-following interior point algorithm for general linear complementarity problems., , и . J. Glob. Optim., 47 (3): 329-342 (2010)