| 2009 |
|---|
| 38 | EE | Tamás Terlaky:
Least-index Anticycling Rules.
Encyclopedia of Optimization 2009: 1847-1851 |
| 37 | EE | Tamás Terlaky:
Lexicographic Pivoting Rules.
Encyclopedia of Optimization 2009: 1870-1873 |
| 36 | EE | Tamás Terlaky:
Principal Pivoting Methods for Linear Complementarity Problems.
Encyclopedia of Optimization 2009: 3067-3073 |
| 35 | EE | Tamás Terlaky:
Criss-Cross Pivoting Rules.
Encyclopedia of Optimization 2009: 584-590 |
| 34 | EE | Tianshi Jiao,
Jiming Peng,
Tamás Terlaky:
A confidence voting process for ranking problems based on support vector machines.
Annals OR 166(1): 23-38 (2009) |
| 33 | EE | Antoine Deza,
Tamás Terlaky,
Yuriy Zinchenko:
A Continuous d -Step Conjecture for Polytopes.
Discrete & Computational Geometry 41(2): 318-327 (2009) |
| 2008 |
|---|
| 32 | EE | Antoine Deza,
Sui Huang,
Tamon Stephen,
Tamás Terlaky:
The colourful feasibility problem.
Discrete Applied Mathematics 156(11): 2166-2177 (2008) |
| 31 | EE | Tamás Terlaky,
Anthony Vannelli,
Hu Zhang:
On routing in VLSI design and communication networks.
Discrete Applied Mathematics 156(11): 2178-2194 (2008) |
| 30 | EE | Antoine Deza,
Tamás Terlaky,
Feng Xie,
Yuriy Zinchenko:
Diameter and Curvature: Intriguing Analogies.
Electronic Notes in Discrete Mathematics 31: 221-225 (2008) |
| 29 | EE | Maziar Salahi,
M. Reza Peyghami,
Tamás Terlaky:
New complexity analysis of IIPMs for linear optimization based on a specific self-regular function.
European Journal of Operational Research 186(2): 466-485 (2008) |
| 28 | EE | Tibor Illés,
Marco A. Lopez,
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.
European Journal of Operational Research 191(3): 771-772 (2008) |
| 27 | EE | Mohamed Saad,
Tamás Terlaky,
Anthony Vannelli,
Hu Zhang:
Packing trees in communication networks.
J. Comb. Optim. 16(4): 402-423 (2008) |
| 26 | EE | Antoine Deza,
Eissa Nematollahi,
Tamás Terlaky:
How good are interior point methods? Klee-Minty cubes tighten iteration-complexity bounds.
Math. Program. 113(1): 1-14 (2008) |
| 25 | EE | Antoine Deza,
Tamás Terlaky,
Yuriy Zinchenko:
Polytopes and arrangements: Diameter and curvature.
Oper. Res. Lett. 36(2): 215-222 (2008) |
| 24 | EE | Eissa Nematollahi,
Tamás Terlaky:
A redundant Klee-Minty construction with all the redundant constraints touching the feasible region.
Oper. Res. Lett. 36(4): 414-418 (2008) |
| 23 | EE | Eissa Nematollahi,
Tamás Terlaky:
A simpler and tighter redundant Klee-Minty construction.
Optimization Letters 2(3): 403-414 (2008) |
| 22 | EE | Tamás Terlaky,
Jiaping Zhu:
Comments on "Dual methods for nonconvex spectrum optimization of multicarrier systems".
Optimization Letters 2(4): 497-503 (2008) |
| 2007 |
|---|
| 21 | EE | Mirjam Dür,
Bülent Karasözen,
Tamás Terlaky,
Gerhard-Wilhelm Weber:
Challenges of Continuous Optimization in Theory and Applications.
European Journal of Operational Research 181(3): 1065-1068 (2007) |
| 20 | EE | Maziar Salahi,
Tamás Terlaky:
Postponing the choice of the barrier parameter in Mehrotra-type predictor-corrector algorithms.
European Journal of Operational Research 182(2): 502-513 (2007) |
| 2006 |
|---|
| 19 | EE | Antoine Deza,
Sui Huang,
Tamon Stephen,
Tamás Terlaky:
Colourful Simplicial Depth.
Discrete & Computational Geometry 35(4): 597-615 (2006) |
| 18 | EE | Bülent Karasözen,
Mustafa Ç. Pinar,
Tamás Terlaky,
Gerhard-Wilhelm Weber:
Feature Cluster "Advances in Continuous Optimization".
European Journal of Operational Research 169(3): 1077-1078 (2006) |
| 17 | EE | Alireza Ghaffari Hadigheh,
Tamás Terlaky:
Sensitivity analysis in linear optimization: Invariant support set intervals.
European Journal of Operational Research 169(3): 1158-1175 (2006) |
| 2005 |
|---|
| 16 | EE | Tamás Terlaky,
Anthony Vannelli,
Hu Zhang:
On Routing in VLSI Design and Communication Networks.
ISAAC 2005: 1051-1060 |
| 15 | EE | Mohamed Saad,
Tamás Terlaky,
Anthony Vannelli,
Hu Zhang:
Packing Trees in Communication Networks.
WINE 2005: 688-697 |
| 2004 |
|---|
| 14 | EE | 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).
European Journal of Operational Research 157(1): 1-2 (2004) |
| 2003 |
|---|
| 13 | EE | Erling D. Andersen,
Cornelis Roos,
Tamás Terlaky:
On implementing a primal-dual interior-point method for conic quadratic optimization.
Math. Program. 95(2): 249-277 (2003) |
| 2002 |
|---|
| 12 | EE | Tibor Illés,
Tamás Rapcsák,
Tamás Terlaky:
IPM 2000. Continuous Optimization.
European Journal of Operational Research 143(2): 231-233 (2002) |
| 11 | EE | Jiming Peng,
Cornelis Roos,
Tamás Terlaky:
A new class of polynomial primal-dual methods for linear and semidefinite optimization.
European Journal of Operational Research 143(2): 234-256 (2002) |
| 1999 |
|---|
| 10 | EE | Cornelis Roos,
Tamás Terlaky:
Note on a paper of Broyden.
Oper. Res. Lett. 25(4): 183-186 (1999) |
| 1998 |
|---|
| 9 | | Etienne de Klerk,
Cornelis Roos,
Tamás Terlaky:
Polynomial Primal-Dual Affine Scaling Algorithms in Semidefinite Programming.
J. Comb. Optim. 2(1): 51-69 (1998) |
| 1997 |
|---|
| 8 | EE | Joost P. Warners,
Tamás Terlaky,
Cornelis Roos,
Benjamin Jansen:
A Potential Reduction Approach to the Frequency Assignment Problem.
Discrete Applied Mathematics 78(1-3): 251-282 (1997) |
| 7 | | Benjamin Jansen,
Kees Roos,
Tamás Terlaky,
Akiko Yoshise:
Polynomiality of primal-dual affine scaling algorithms for nonlinear complementarity problems.
Math. Program. 77: 315-345 (1997) |
| 6 | | Komei Fukuda,
Tamás Terlaky:
Criss-cross methods: A fresh view on pivot algorithms.
Math. Program. 79: 369-395 (1997) |
| 5 | EE | Joost P. Warners,
Tamás Terlaky,
Cornelis Roos,
Benjamin Jansen:
Potential reduction algorithms for structured combinatorial optimization problems.
Oper. Res. Lett. 21(2): 55-64 (1997) |
| 1996 |
|---|
| 4 | | Benjamin Jansen,
Kees Roos,
Tamás Terlaky,
Yinyu Ye:
Improved complexity using higher-order correctors for primal-dual Dikin affine scaling.
Math. Program. 76: 117-130 (1996) |
| 1995 |
|---|
| 3 | | Dick den Hertog,
Florian Jarre,
Kees Roos,
Tamás Terlaky:
A sufficient condition for self-concordance, with application to some classes of structured convex programming problems.
Math. Program. 69: 75-88 (1995) |
| 1993 |
|---|
| 2 | | Kurt M. Anstreicher,
Dick den Hertog,
Cornelis Roos,
Tamás Terlaky:
A Long-Step Barrier Method for Convex Quadratic Programming.
Algorithmica 10(5): 365-382 (1993) |
| 1987 |
|---|
| 1 | EE | Tamás Terlaky:
A finite crisscross method for oriented matroids.
J. Comb. Theory, Ser. B 42(3): 319-327 (1987) |
