default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTibor Illés
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j29]Tibor Illés, Florian Jarre, Etienne de Klerk, Goran Lesaja
:
Conic Optimization and Interior Point Methods: Theory, Computations, and Applications. J. Optim. Theory Appl. 202(1): 1-10 (2024)- [j28]Tibor Illés, Petra Renáta Rigó, Roland Török:
Unified Approach of Interior-Point Algorithms for P*(κ )-LCPs Using a New Class of Algebraically Equivalent Transformations. J. Optim. Theory Appl. 202(1): 27-49 (2024) - [j27]Marianna E.-Nagy, Tibor Illés, Janez Povh, Anita Varga, Janez Zerovnik:
Sufficient Matrices: Properties, Generating and Testing. J. Optim. Theory Appl. 202(1): 204-236 (2024) - 2023
- [j26]Tibor Illés, Petra Renáta Rigó, Roland Török:
Large-step predictor-corrector interior point method for sufficient linear complementarity problems based on the algebraic equivalent transformation. EURO J. Comput. Optim. 11: 100072 (2023) - 2022
- [j25]Tibor Illés, Tamás Terlaky:
EUROpt, the Continuous Optimization Working Group of EURO: From idea to maturity. EURO J. Comput. Optim. 10: 100033 (2022) - [j24]Miguel F. Anjos, Tibor Illés, Tamás Terlaky:
Celebrating 20 years of EUROpt. EURO J. Comput. Optim. 10: 100036 (2022) - [j23]Zsolt Darvay, Tibor Illés, Petra Renáta Rigó:
Predictor-corrector interior-point algorithm for P*(κ)-linear complementarity problems based on a new type of algebraic equivalent transformation technique. Eur. J. Oper. Res. 298(1): 25-35 (2022) - 2021
- [j22]Zsolt Darvay, Tibor Illés, Csilla Majoros:
Interior-point algorithm for sufficient LCPs based on the technique of algebraically equivalent transformation. Optim. Lett. 15(2): 357-376 (2021) - 2020
- [j21]Zsolt Darvay, Tibor Illés, Behrouz Kheirfam, Petra Renáta Rigó:
A corrector-predictor interior-point method with new search direction for linear optimization. Central Eur. J. Oper. Res. 28(3): 1123-1140 (2020) - [j20]Zsolt Darvay, Tibor Illés, Janez Povh, Petra Renáta Rigó:
Feasible Corrector-Predictor Interior-Point Algorithm for P* (κ)-Linear Complementarity Problems Based on a New Search Direction. SIAM J. Optim. 30(3): 2628-2658 (2020)
2010 – 2019
- 2019
- [j19]Marianna Eisenberg-Nagy, Tibor Illés, Gábor Lovics:
Market exchange models and geometric programming. Central Eur. J. Oper. Res. 27(2): 415-435 (2019) - 2018
- [j18]Adrienn Csizmadia, Zsolt Csizmadia, Tibor Illés:
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) - 2016
- [j17]Tibor Illés, Richárd Molnár-Szipai:
Strongly polynomial primal monotonic build-up simplex algorithm for maximal flow problems. Discret. Appl. Math. 214: 201-210 (2016) - 2015
- [j16]Botond Bertók, Tibor Csendes, Tibor Illés:
Editorial. Central Eur. J. Oper. Res. 23(4): 811-813 (2015) - 2012
- [j15]Zsolt Csizmadia, Tibor Illés, Adrienn Nagy:
The s-monotone index selection rules for pivot algorithms of linear programming. Eur. J. Oper. Res. 221(3): 491-500 (2012) - 2010
- [j14]Tibor Illés, Marianna Nagy, Tamás Terlaky:
Polynomial Interior Point Algorithms for General Linear Complementarity Problems. Algorithmic Oper. Res. 5(1): 1-12 (2010) - [j13]Tibor Illés, Marianna Nagy, Tamás Terlaky:
A polynomial path-following interior point algorithm for general linear complementarity problems. J. Glob. Optim. 47(3): 329-342 (2010)
2000 – 2009
- 2008
- [j12]Tibor Illés, Marco A. López, Tamás Terlaky, József Vörös, Gerhard-Wilhelm Weber:
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) - 2007
- [j11]Tibor Illés, Marianna Nagy:
A Mizuno-Todd-Ye type predictor-corrector algorithm for sufficient linear complementarity problems. Eur. J. Oper. Res. 181(3): 1097-1111 (2007) - [j10]Filiz Bilen, Zsolt Csizmadia, Tibor Illés:
Anstreicher-Terlaky type monotonic simplex algorithms for linear feasibility problems. Optim. Methods Softw. 22(4): 679-695 (2007) - 2006
- [j9]Zsolt Csizmadia, Tibor Illés:
New criss-cross type algorithms for linear complementarity problems with sufficient matrices. Optim. Methods Softw. 21(2): 247-266 (2006) - 2005
- [c1]Tibor Illés, Márton Makai, Zsuzsanna Vaik:
Combinatorial Optimization Model for Railway Engine Assignment Problem. ATMOS 2005 - 2004
- [j8]Jan Brinkhuis, Tibor Illés, Hans Frenk, Georg Still, Gerhard-Wilhelm Weber, Tamás Terlaky:
International workshop on smooth and nonsmooth optimization (Rotterdam, July 12-13, 2001). Eur. J. Oper. Res. 157(1): 1-2 (2004) - [j7]Arif A. Akkeles, László Balogh, Tibor Illés:
New variants of the criss-cross method for linearly constrained convex quadratic programming. Eur. J. Oper. Res. 157(1): 74-86 (2004) - 2002
- [j6]Tibor Illés, Tamás Terlaky:
Pivot versus interior point methods: Pros and cons. Eur. J. Oper. Res. 140(2): 170-190 (2002) - [j5]Tibor Illés, Tamás Rapcsák, Tamás Terlaky:
IPM 2000. Continuous Optimization. Eur. J. Oper. Res. 143(2): 231-233 (2002) - 2001
- [j4]Tibor Illés, David Pisinger:
Upper Bounds on the Covering Number of Galois-Planes with Small Order. J. Heuristics 7(1): 59-76 (2001) - 2000
- [j3]Tibor Illés, Jiming Peng, Cornelis Roos, Tamás Terlaky:
A Strongly Polynomial Rounding Procedure Yielding a Maximally Complementary Solution for P*(kappa) Linear Complementarity Problems. SIAM J. Optim. 11(2): 320-340 (2000)
1990 – 1999
- 1999
- [j2]Tibor Illés, Ákos Szirmai, Tamás Terlaky:
The finite criss-cross method for hyperbolic programming. Eur. J. Oper. Res. 114(1): 198-214 (1999) - 1997
- [j1]Etienne de Klerk, Cornelis Roos, Tamás Terlaky, Tibor Illés, A. J. de Jong, J. Valkó, J. E. Hoogenboom:
Optimization of nuclear reactor reloading patterns. Ann. Oper. Res. 69: 65-84 (1997)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-23 18:34 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
