Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTamás Terlaky
Person information
- affiliation: McMaster University, Hamilton, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
[j113]Zeguan Wu
, Mohammadhossein Mohammadisiahroudi, Brandon Augustino, Xiu Yang, Tamás Terlaky:
An Inexact Feasible Quantum Interior Point Method for Linearly Constrained Quadratic Optimization. Entropy 25(2): 330 (2023)- 2022
- [j112]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) - [j111]Miguel F. Anjos, Tibor Illés, Tamás Terlaky:
Celebrating 20 years of EUROpt. EURO J. Comput. Optim. 10: 100036 (2022) - [j110]Rodolfo Quintero, David E. Bernal, Tamás Terlaky, Luis F. Zuluaga:
Characterization of QUBO reformulations for the maximum k-colorable subgraph problem. Quantum Inf. Process. 21(3): 89 (2022) - [c4]Mohammadhossein Mohammadisiahroudi, Zeguan Wu, Brandon Augustino, Tamás Terlaky, Arielle Carr:
Quantum-enhanced Regression Analysis Using State-of-the-art QLSAs and QIPMs. SEC 2022: 375-380 - 2021
- [j109]Ali Mohammad Nezhad, Tamás Terlaky:
On the sensitivity of the optimal partition for parametric second-order conic optimization. Math. Program. 189(1): 491-525 (2021) - [j108]Mohammad Pirhooshyaran, Tamás Terlaky:
Quantum circuit design search. Quantum Mach. Intell. 3(2): 1-14 (2021) - 2020
- [j107]Ali Mohammad Nezhad, Tamás Terlaky:
On the identification of the optimal partition for semidefinite optimization. INFOR Inf. Syst. Oper. Res. 58(2): 225-263 (2020) - [i2]Muqing Zheng, Ang Li, Tamás Terlaky, Xiu Yang:
A Bayesian Approach for Characterizing and Mitigating Gate and Measurement Errors. CoRR abs/2010.09188 (2020) - [i1]Mohammad Pirhooshyaran, Tamás Terlaky:
Quantum Circuit Design Search. CoRR abs/2012.04046 (2020)
2010 – 2019
- 2019
- [j106]Dan Li, Tamás Terlaky:
Examples with decreasing largest inscribed ball for deterministic rescaling algorithms. INFOR Inf. Syst. Oper. Res. 57(4): 517-534 (2019) - [j105]Ali Mohammad Nezhad, Tamás Terlaky:
Quadratic convergence to the optimal solution of second-order conic optimization without strict complementarity. Optim. Methods Softw. 34(5): 960-990 (2019) - [j104]Ali Mohammad Nezhad, Tamás Terlaky:
A rounding procedure for semidefinite optimization. Oper. Res. Lett. 47(1): 59-65 (2019) - 2018
- [j103]Mohammad Shahabsafa, Tamás Terlaky, Naga Venkata C. Gudapati, Anshul Sharma, George R. Wilson, Louis J. Plebani, Kristofer B. Bucklen:
The Inmate Assignment and Scheduling Problem and Its Application in the Pennsylvania Department of Corrections. Interfaces 48(5): 467-483 (2018) - [j102]Mohammad Shahabsafa, Julio Cesar Goez, Tamás Terlaky:
On pathological disjunctions and redundant disjunctive conic cuts. Oper. Res. Lett. 46(5): 500-504 (2018) - 2017
- [j101]Zoltán Horváth, Yunfei Song, Tamás Terlaky:
A novel unified approach to invariance conditions for a linear dynamical system. Appl. Math. Comput. 298: 351-367 (2017) - [j100]Ali Mohammad Nezhad, Tamás Terlaky:
A polynomial primal-dual affine scaling algorithm for symmetric conic optimization. Comput. Optim. Appl. 66(3): 577-600 (2017) - [j99]Pietro Belotti, Julio Cesar Goez, Imre Pólik, Ted K. Ralphs, Tamás Terlaky:
A complete characterization of disjunctive conic cuts for mixed integer second order cone optimization. Discret. Optim. 24: 3-31 (2017) - [j98]Tamás Terlaky:
András Prékopa 1929-2016. Eur. J. Oper. Res. 258(1): 1 (2017) - 2016
- [j97]Murat Mut, Tamás Terlaky:
An Analogue of the Klee-Walkup Result for Sonnevend's Curvature of the Central Path. J. Optim. Theory Appl. 169(1): 17-31 (2016) - 2014
- [j96]Tamás Terlaky, Zhouhong Wang:
On the Identification of the Optimal Partition of Second Order Cone Optimization Problems. SIAM J. Optim. 24(1): 385-414 (2014) - 2013
- [j95]Pietro Belotti, Julio Cesar Goez, Imre Pólik, Ted K. Ralphs, Tamás Terlaky:
On families of quadratic surfaces having fixed intersections with two hyperplanes. Discret. Appl. Math. 161(16-17): 2778-2793 (2013) - [j94]Tamás Terlaky, Etienne de Klerk, Goran Lesaja, Dick den Hertog:
Special issue in honour of Professor Kees Roos' 70th Birthday. Optim. Methods Softw. 28(3): 393-395 (2013) - 2012
- [j93]István Deák, Imre Pólik, András Prékopa, Tamás Terlaky:
Convex approximations in stochastic programming by semidefinite programming. Ann. Oper. Res. 200(1): 171-182 (2012) - [j92]Murat Mut, Tamás Terlaky:
On the volumetric path. Optim. Lett. 6(4): 687-693 (2012) - 2011
- [j91]Christopher Kumar Anand, Stephen J. Stoyan, Tamás Terlaky:
Optimizing the gVERSE RF Pulse Sequence: An Evaluation of Two Competitive Software Algorithms. Algorithmic Oper. Res. 6(1): 1-19 (2011) - [j90]Mohammad R. Oskoorouchi, Hamid R. Ghaffari, Tamás Terlaky, Dionne M. Aleman:
An Interior Point Constraint Generation Algorithm for Semi-Infinite Optimization with Health-Care Application. Oper. Res. 59(5): 1184-1197 (2011) - [j89]Botond Bertók, Zoltán Süle, Tamás Terlaky:
Preface. Optim. Methods Softw. 26(3): 345-346 (2011) - 2010
- [j88]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) - [j87]Warren L. Hare, M. J. J. Liu, Tamás Terlaky:
Efficient preprocessing for VLSI optimization problems. Comput. Optim. Appl. 45(3): 475-493 (2010) - [j86]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) - [j85]Miguel A. Goberna, Tamás Terlaky, Maxim I. Todorov:
Sensitivity Analysis in Linear Semi-Infinite Programming via Partitions. Math. Oper. Res. 35(1): 14-26 (2010) - [j84]Ekaterina A. Kostina, Tamás Terlaky:
Foreword. Optim. Methods Softw. 25(2): 169-170 (2010) - [j83]Alireza Ghaffari Hadigheh, Oleksandr Romanko, Tamás Terlaky:
Bi-parametric convex quadratic optimization. Optim. Methods Softw. 25(2): 229-245 (2010) - [j82]Botond Bertók, Tamás Terlaky:
Preface. Optim. Methods Softw. 25(3): 335-336 (2010) - [j81]Mohammad H. Koulaei, Tamás Terlaky:
On the complexity analysis of a Mehrotra-type primal-dual feasible algorithm for semidefinite optimization. Optim. Methods Softw. 25(3): 467-485 (2010) - [j80]Yang Li, Tamás Terlaky:
A New Class of Large Neighborhood Path-Following Interior Point Algorithms for Semidefinite Optimization with O(√n log (Tr(X0S0)/ε)) Iteration Complexity. SIAM J. Optim. 20(6): 2853-2875 (2010)
2000 – 2009
- 2009
- [j79]Tianshi Jiao, Jiming Peng, Tamás Terlaky:
A confidence voting process for ranking problems based on support vector machines. Ann. Oper. Res. 166(1): 23-38 (2009) - [j78]Maziar Salahi, Tamás Terlaky:
A Hybrid Adaptive Algorithm for Linear Optimization. Asia Pac. J. Oper. Res. 26(2): 235-256 (2009) - [j77]Peng Du, Jiming Peng, Tamás Terlaky:
Self-adaptive support vector machines: modelling and experiments. Comput. Manag. Sci. 6(1): 41-51 (2009) - [j76]Antoine Deza, Tamás Terlaky, Yuriy Zinchenko:
A Continuous d -Step Conjecture for Polytopes. Discret. Comput. Geom. 41(2): 318-327 (2009) - [j75]Imre Pólik, Tamás Terlaky:
New stopping criteria for detecting infeasibility in conic optimization. Optim. Lett. 3(2): 187-198 (2009) - [j74]Logan M. Rakai, Laleh Behjat, Shawki Areibi, Tamás Terlaky:
A Multilevel Congestion-Based Global Router. VLSI Design 2009: 537341:1-537341:13 (2009) - [r4]Tamás Terlaky:
Criss-Cross Pivoting Rules. Encyclopedia of Optimization 2009: 584-590 - [r3]Tamás Terlaky:
Least-index Anticycling Rules. Encyclopedia of Optimization 2009: 1847-1851 - [r2]Tamás Terlaky:
Lexicographic Pivoting Rules. Encyclopedia of Optimization 2009: 1870-1873 - [r1]Tamás Terlaky:
Principal Pivoting Methods for Linear Complementarity Problems. Encyclopedia of Optimization 2009: 3067-3073 - 2008
- [j73]Oliver Stein, Georg Still, Tamás Terlaky, Gerhard-Wilhelm Weber:
Editorial. Central Eur. J. Oper. Res. 16(2): 107-109 (2008) - [j72]Alireza Ghaffari Hadigheh, Habib Ghaffari Hadigheh, Tamás Terlaky:
Bi-parametric optimal partition invariancy sensitivity analysis in linear optimization. Central Eur. J. Oper. Res. 16(2): 215-238 (2008) - [j71]Antoine Deza, Sui Huang, Tamon Stephen, Tamás Terlaky:
The colourful feasibility problem. Discret. Appl. Math. 156(11): 2166-2177 (2008) - [j70]Tamás Terlaky, Anthony Vannelli, Hu Zhang:
On routing in VLSI design and communication networks. Discret. Appl. Math. 156(11): 2178-2194 (2008) - [j69]Antoine Deza, Tamás Terlaky, Feng Xie, Yuriy Zinchenko:
Diameter and Curvature: Intriguing Analogies. Electron. Notes Discret. Math. 31: 221-225 (2008) - [j68]Maziar Salahi, M. Reza Peyghami, Tamás Terlaky:
New complexity analysis of IIPMs for linear optimization based on a specific self-regular function. Eur. J. Oper. Res. 186(2): 466-485 (2008) - [j67]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) - [j66]Mohamed Saad, Tamás Terlaky, Anthony Vannelli, Hu Zhang:
Packing trees in communication networks. J. Comb. Optim. 16(4): 402-423 (2008) - [j65]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) - [j64]Eissa Nematollahi, Tamás Terlaky:
A simpler and tighter redundant Klee-Minty construction. Optim. Lett. 2(3): 403-414 (2008) - [j63]Tamás Terlaky, Jiaping Zhu:
Comments on "Dual methods for nonconvex spectrum optimization of multicarrier systems". Optim. Lett. 2(4): 497-503 (2008) - [j62]Maziar Salahi, Tamás Terlaky:
Mehrotra-type predictor-corrector algorithm revisited. Optim. Methods Softw. 23(2): 259-273 (2008) - [j61]Christopher Kumar Anand, Tingting Ren, Tamás Terlaky:
Optimizing Teardrop, an MRI sampling trajectory. Optim. Methods Softw. 23(4): 575-592 (2008) - [j60]Antoine Deza, Tamás Terlaky, Yuriy Zinchenko:
Polytopes and arrangements: Diameter and curvature. Oper. Res. Lett. 36(2): 215-222 (2008) - [j59]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) - 2007
- [j58]Alireza Ghaffari Hadigheh, Oleksandr Romanko, Tamás Terlaky:
Sensitivity analysis in convex quadratic optimization: Simultaneous perturbation of the objective and right-hand-side vectors. Algorithmic Oper. Res. 2(2): 94-111 (2007) - [j57]Mirjam Dür, Bülent Karasözen, Tamás Terlaky, Gerhard-Wilhelm Weber:
Challenges of Continuous Optimization in Theory and Applications. Eur. J. Oper. Res. 181(3): 1065-1068 (2007) - [j56]Maziar Salahi, Tamás Terlaky:
Postponing the choice of the barrier parameter in Mehrotra-type predictor-corrector algorithms. Eur. J. Oper. Res. 182(2): 502-513 (2007) - [j55]Maziar Salahi, Jiming Peng, Tamás Terlaky:
On Mehrotra-Type Predictor-Corrector Algorithms. SIAM J. Optim. 18(4): 1377-1397 (2007) - [j54]Imre Pólik, Tamás Terlaky:
A Survey of the S-Lemma. SIAM Rev. 49(3): 371-418 (2007) - 2006
- [j53]Maziar Salahi, Tamás Terlaky, Guoqing Zhang:
The Complexity of Self-Regular Proximity Based Infeasible IPMs. Comput. Optim. Appl. 33(2-3): 157-185 (2006) - [j52]Antoine Deza, Sui Huang, Tamon Stephen, Tamás Terlaky:
Colourful Simplicial Depth. Discret. Comput. Geom. 35(4): 597-615 (2006) - [j51]Bülent Karasözen, Mustafa Ç. Pinar, Tamás Terlaky, Gerhard-Wilhelm Weber:
Feature Cluster "Advances in Continuous Optimization". Eur. J. Oper. Res. 169(3): 1077-1078 (2006) - [j50]Alireza Ghaffari Hadigheh, Tamás Terlaky:
Sensitivity analysis in linear optimization: Invariant support set intervals. Eur. J. Oper. Res. 169(3): 1158-1175 (2006) - [j49]Antoine Deza, Eissa Nematollahi, M. Reza Peyghami, Tamás Terlaky:
The central path visits all the vertices of the Klee-Minty cube. Optim. Methods Softw. 21(5): 851-865 (2006) - [c3]Christopher Kumar Anand, Stephen J. Stoyan, Tamás Terlaky:
The gVERSE RF Pulse: An Optimal Approach to MRI Pulse Design. HPSC 2006: 25-48 - 2005
- [j48]Maziar Salahi, Tamás Terlaky:
An adaptive self-regular proximity-based large-update IPM for LO. Optim. Methods Softw. 20(1): 169-185 (2005) - [j47]Jiming Peng, Tamás Terlaky, Yunbin Zhao:
A Predictor-Corrector Algorithm for Linear Optimization Based on a Specific Self-Regular Proximity Function. SIAM J. Optim. 15(4): 1105-1127 (2005) - [c2]Tamás Terlaky, Anthony Vannelli, Hu Zhang:
On Routing in VLSI Design and Communication Networks. ISAAC 2005: 1051-1060 - [c1]Mohamed Saad, Tamás Terlaky, Anthony Vannelli, Hu Zhang:
Packing Trees in Communication Networks. WINE 2005: 688-697 - 2004
- [j46]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) - 2003
- [j45]Tamás Terlaky:
Book Review: Computational Techniques of the Simplex Method. Comput. Optim. Appl. 26(2): 209-210 (2003) - [j44]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
- [b2]Jiming Peng, Cornelis Roos, Tamás Terlaky:
Self-regularity - a new paradigm for primal-dual interior-point algorithms. Princeton series in applied mathematics, Princeton University Press 2002, ISBN 978-0-691-09193-8, pp. I-XIII, 1-185 - [j43]Tibor Illés, Tamás Terlaky:
Pivot versus interior point methods: Pros and cons. Eur. J. Oper. Res. 140(2): 170-190 (2002) - [j42]Tibor Illés, Tamás Rapcsák, Tamás Terlaky:
IPM 2000. Continuous Optimization. Eur. J. Oper. Res. 143(2): 231-233 (2002) - [j41]Jiming Peng, Cornelis Roos, Tamás Terlaky:
A new class of polynomial primal-dual methods for linear and semidefinite optimization. Eur. J. Oper. Res. 143(2): 234-256 (2002) - [j40]Jiming Peng, Cornelis Roos, Tamás Terlaky:
Self-regular functions and new search directions for linear and semidefinite optimization. Math. Program. 93(1): 129-171 (2002) - [j39]Jiming Peng, Tamás Terlaky:
A dynamic large-update primal-dual interior-point method for linear optimization. Optim. Methods Softw. 17(6): 1077-1104 (2002) - [j38]Jiming Peng, Cornelis Roos, Tamás Terlaky:
Primal-Dual Interior-Point Methods for Second-Order Conic Optimization Based on Self-Regular Proximities. SIAM J. Optim. 13(1): 179-203 (2002) - 2001
- [j37]Tamás Terlaky:
An easy way to teach interior-point methods. Eur. J. Oper. Res. 130(1): 1-19 (2001) - [j36]Etienne de Klerk, Jiming Peng, Cees Roos, Tamás Terlaky:
A Scaled Gauss--Newton Primal-Dual Search Direction for Semidefinite Optimization. SIAM J. Optim. 11(4): 870-888 (2001) - 2000
- [j35]Jiming Peng, Cees Roos, Tamás Terlaky:
New Complexity Analysis of the Primal - Dual Newton Method for Linear Optimization. Ann. Oper. Res. 99(1-4): 23-39 (2000) - [j34]Immanuel M. Bomze, Mirjam Dür, Etienne de Klerk, Cornelis Roos, Arie J. Quist, Tamás Terlaky:
On Copositive Programming and Standard Quadratic Optimization Problems. J. Glob. Optim. 18(4): 301-320 (2000) - [j33]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
- [j32]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) - [j31]Arjan Berkelaar, Benjamin Jansen, Kees Roos, Tamás Terlaky:
Basis- and partition identification for quadratic programming and linear complementarity problems. Math. Program. 86(2): 261-282 (1999) - [j30]Arkadi Nemirovski, Cornelis Roos, Tamás Terlaky:
On maximization of quadratic form over intersection of ellipsoids with common center. Math. Program. 86(3): 463-473 (1999) - [j29]Cornelis Roos, Tamás Terlaky:
Note on a paper of Broyden. Oper. Res. Lett. 25(4): 183-186 (1999) - 1998
- [b1]Cornelis Roos, Tamás Terlaky, Jean-Philippe Vial:
Theory and algorithms for linear optimization - an interior point approach. Wiley-Interscience series in discrete mathematics and optimization, Wiley 1998, ISBN 978-0-471-95676-1, pp. I-XXIV, 1-482 - [j28]Etienne de Klerk, Cornelis Roos, Tamás Terlaky:
A nonconvex weighted potential function forpolynomial target following methods. Ann. Oper. Res. 81: 3-14 (1998) - [j27]Tamás Terlaky:
Optimization. Algorithms and consistent approximations : Elijah Polak Springer, New York, NY, 1997, ISBN 0-38794971-2, hb., 118 DM, 779 pages. Eur. J. Oper. Res. 107(3): 755-756 (1998) - [j26]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) - [j25]Harvey J. Greenberg, Allen G. Holder, Kees Roos, Tamás Terlaky:
On the Dimension of the Set of Rim Perturbations for Optimal Partition Invariance. SIAM J. Optim. 9(1): 207-216 (1998) - [j24]Tamás Terlaky, Jean-Philippe Vial:
Computing Maximum Likelihood Estimators of Convex Density Functions. SIAM J. Sci. Comput. 19(2): 675-694 (1998) - 1997
- [j23]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) - [j22]Joost P. Warners, Tamás Terlaky, Cornelis Roos, Benjamin Jansen:
A Potential Reduction Approach to the Frequency Assignment Problem. Discret. Appl. Math. 78(1-3): 251-282 (1997) - [j21]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) - [j20]Komei Fukuda, Tamás Terlaky:
Criss-cross methods: A fresh view on pivot algorithms. Math. Program. 79: 369-395 (1997) - [j19]Hans van Maaren, Tamás Terlaky:
Inverse barriers and CES-functions in linear programming. Oper. Res. Lett. 20(1): 15-20 (1997) - [j18]Etienne de Klerk, Cornelis Roos, Tamás Terlaky:
Initialization in semidefinite programming via a self-dual skew-symmetric embedding. Oper. Res. Lett. 20(5): 213-221 (1997) - [j17]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) - [j16]Benjamin Jansen, Cornelis Roos, Tamás Terlaky:
A Family of Polynomial Affine Scaling Algorithms for Positive SemiDefinite Linear Complementarity Problems. SIAM J. Optim. 7(1): 126-140 (1997) - 1996
- [j15]Benjamin Jansen, Cornelis Roos, Tamás Terlaky, Jean-Philippe Vial:
Primal-dual target-following algorithms for linear programming. Ann. Oper. Res. 62(1): 197-231 (1996) - [j14]Benjamin Jansen, Cornelis Roos, Tamás Terlaky, Jean-Philippe Vial:
Long-step primal-dual target-following algorithms for linear programming. Math. Methods Oper. Res. 44(1): 11-30 (1996) - [j13]Benjamin Jansen, Cees Roos, Tamás Terlaky:
A Polynomial Primal-Dual Dikin-Type Algorithm for Linear Programming. Math. Oper. Res. 21(2): 341-353 (1996) - [j12]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) - [j11]Luis F. Portugal, Frederico Machado Bastos, Joaquim Júdice, José M. P. Paixão, Tamás Terlaky:
An Investigation of Interior-Point Algorithms for the Linear Transportation Problem. SIAM J. Sci. Comput. 17(5): 1202-1223 (1996) - 1995
- [j10]Dick den Hertog, John Kaliski, Cees Roos, Tamás Terlaky:
A logarithmic barrier cutting plane method for convex programming. Ann. Oper. Res. 58(2): 67-98 (1995) - [j9]