zbMATH — the first resource for mathematics

Anstreicher, Kurt M.

Compute Distance To:
 Author ID: anstreicher.kurt-m Published as: Anstreicher, Kurt M.; Anstreicher, Kurt; Anstreicher, K. M. External Links: MGP
 Documents Indexed: 68 Publications since 1986, including 1 Book
all top 5

Co-Authors

 36 single-authored 5 Burer, Samuel 5 Fampa, Marcia Helena C. 4 Brixius, Nathan W. 4 Lee, Jon 3 Bosch, Robert Alexander Mark 3 Williams, Joy 3 Ye, Yinyu 2 Dong, Hongbo 2 Ji, Jun 2 Potra, Florian-Alexandru 2 Terlaky, Tamás 2 Wolkowicz, Henry 1 Chen, Xin 1 den Hertog, Dick 1 Dür, Mirjam 1 Goux, Jean-Pierre 1 Linderoth, Jeff T. 1 Roos, Cornelis 1 Rothblum, Uriel George 1 Rutherford, Thomas F. 1 Van Laarhoven, Jon W. 1 Watteyne, Patrick 1 Wolsey, Laurence Alexander 1 Wright, Margaret H. 1 Yang, Boshi 1 Yuan, Ya-xiang
all top 5

Serials

 20 Mathematical Programming. Series A. Series B 10 SIAM Journal on Optimization 6 Linear Algebra and its Applications 5 Mathematics of Operations Research 3 Operations Research 3 Algorithmica 3 Journal of Global Optimization 2 Operations Research Letters 2 Discrete & Computational Geometry 2 Optimization Methods & Software 1 Discrete Applied Mathematics 1 SIAM Journal on Matrix Analysis and Applications 1 Annals of Operations Research 1 Computational Geometry 1 Discrete Optimization
all top 5

Fields

 63 Operations research, mathematical programming (90-XX) 12 Numerical analysis (65-XX) 4 Linear and multilinear algebra; matrix theory (15-XX) 3 Convex and discrete geometry (52-XX) 2 Combinatorics (05-XX) 2 Statistics (62-XX) 2 Computer science (68-XX) 1 General and overarching topics; collections (00-XX)

Citations contained in zbMATH Open

63 Publications have been cited 777 times in 570 Documents Cited by Year
Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming. Zbl 1169.90425
Anstreicher, Kurt M.
2009
Second-order-cone constraints for extended trust-region subproblems. Zbl 1298.90062
Burer, Samuel; Anstreicher, Kurt M.
2013
A monotonic projective algorithm for fractional linear programming. Zbl 0625.90088
Anstreicher, Kurt M.
1986
On quadratic and $$O(\sqrt{n}L)$$ convergence of a predictor-corrector algorithm for LCP. Zbl 0799.90111
Ye, Yinyu; Anstreicher, Kurt
1993
Solving large quadratic assignment problems on computational grids. Zbl 1030.90105
Anstreicher, Kurt; Brixius, Nathan; Goux, Jean-Pierre; Linderoth, Jeff
2002
Computable representations for convex hulls of low-dimensional quadratic forms. Zbl 1198.90311
Anstreicher, Kurt M.; Burer, Samuel
2010
On convex relaxations for quadratically constrained quadratic programming. Zbl 1267.90103
Anstreicher, Kurt M.
2012
Recent advances in the solution of quadratic assignment problems. Zbl 1035.90067
Anstreicher, Kurt M.
2003
On Lagrangian relaxation of quadratic matrix constraints. Zbl 0990.90088
Anstreicher, Kurt; Wolkowicz, Henry
2000
A new bound for the quadratic assignment problem based on convex quadratic programming. Zbl 0986.90042
Anstreicher, Kurt M.; Brixius, Nathan W.
2001
Using Gauss-Jordan elimination to compute the index, generalized nullspaces, and Drazin inverse. Zbl 0613.65028
Anstreicher, Kurt M.; Rothblum, Uriel G.
1987
The difference between $$5\times 5$$ doubly nonnegative and completely positive matrices. Zbl 1175.15026
Burer, Samuel; Anstreicher, Kurt M.; Dür, Mirjam
2009
Two “well-known” properties of subgradient optimization. Zbl 1180.90179
Anstreicher, Kurt M.; Wolsey, Laurence A.
2009
A combined phase I-phase II projective algorithm for linear programming. Zbl 0662.90048
Anstreicher, Kurt M.
1989
Linear programming in $$O([n^3/\ln n]L)$$ operations. Zbl 0955.90085
Anstreicher, K. M.
1999
D.C. versus copositive bounds for standard QP. Zbl 1093.90033
Anstreicher, Kurt M.; Burer, Samuel
2005
Solving quadratic assignment problems using convex quadratic programming relaxations. Zbl 0991.90107
Brixius, Nathan W.; Anstreicher, Kurt M.
2001
A monotonic build-up simplex algorithm for linear programming. Zbl 0810.90089
Anstreicher, Kurt M.; Terlaky, Tamás
1994
Separating doubly nonnegative and completely positive matrices. Zbl 1263.90064
Dong, Hongbo; Anstreicher, Kurt
2013
Strong duality for a trust-region type relaxation of the quadratic assignment problem. Zbl 0953.90034
Anstreicher, Kurt; Chen, Xin; Wolkowicz, Henry; Yuan, Yaxiang
1999
Long steps in an $$O(n^ 3L)$$ algorithm for linear programming. Zbl 0783.90066
Anstreicher, Kurt M.; Bosch, Robert A.
1992
A new infinity-norm path following algorithm for linear programming. Zbl 0834.90084
Anstreicher, Kurt M.; Bosch, Robert A.
1995
On Vaidya’s volumetric cutting plane method for convex programming. Zbl 0871.90061
Anstreicher, Kurt M.
1997
Probabilistic analysis of an infeasible-interior-point algorithm for linear programming. Zbl 0977.90019
Anstreicher, Kurt M.; Ji, Jun; Potra, Florian A.; Ye, Yinyu
1999
The thirteen spheres: a new proof. Zbl 1126.52017
Anstreicher, Kurt M.
2004
A combined phase I-phase II scaled potential algorithm for linear programming. Zbl 0747.90060
Anstreicher, Kurt M.
1991
Interior-point algorithms for a generalization of linear programming and weighted centring. Zbl 1254.90106
Anstreicher, Kurt M.
2012
An improved algorithm for computing Steiner minimal trees in Euclidean $$d$$-space. Zbl 1152.90663
Fampa, Marcia; Anstreicher, Kurt M.
2008
Towards a practical volumetric cutting plane method for convex programming. Zbl 1032.90525
Anstreicher, Kurt M.
1998
Using continuous nonlinear relaxations to solve constrained maximum-entropy sampling problems. Zbl 0954.90048
Anstreicher, Kurt M.; Fampa, Marcia; Lee, Jon; Williams, Joy
1999
A long-step barrier method for convex quadratic programming. Zbl 0783.90093
Anstreicher, K. M.; den Hertog, D.; Roos, C.; Terlaky, T.
1993
Quadratic programs with hollows. Zbl 1401.90147
Yang, Boshi; Anstreicher, Kurt; Burer, Samuel
2018
Average performance of a self-dual interior point algorithm for linear programming. Zbl 0968.90519
Anstreicher, Kurt M.; Ji, Jun; Potra, Florian A.; Ye, Yinyu
1993
The volumetric barrier for semidefinite programming. Zbl 1073.90533
Anstreicher, Kurt M.
2000
A family of search directions for Karmarkar’s algorithm. Zbl 0782.90065
Anstreicher, Kurt M.; Watteyne, Patrick
1993
On the performance of Karmarkar’s algorithm over a sequence of iterations. Zbl 0752.90044
Anstreicher, Kurt M.
1991
The worst-case step in Karmarkar’s algorithm. Zbl 0674.90060
Anstreicher, Kurt M.
1989
A standard form variant, and safeguarded linesearch, for the modified Karmarkar algorithm. Zbl 0708.90046
Anstreicher, Kurt M.
1990
A note on “$$5\times 5$$ completely positive matrices”. Zbl 1191.15027
Dong, Hongbo; Anstreicher, Kurt
2010
Ellipsoidal approximations of convex sets based on the volumetric barrier. Zbl 0977.90034
Anstreicher, K. M.
1999
Crashing a maximum-weight complementary basis. Zbl 0764.90082
Anstreicher, Kurt M.; Lee, Jon; Rutherford, Thomas F.
1992
On interior algorithms for linear programming with no regularity assumptions. Zbl 0760.90068
Anstreicher, Kurt M.
1992
Geometric conditions for Euclidean Steiner trees in $$\mathbb R^d$$. Zbl 1277.65014
Van Laarhoven, Jon W.; Anstreicher, Kurt M.
2013
Linear programming and the Newton barrier flow. Zbl 0657.90059
Anstreicher, Kurt M.
1988
On long step path following and SUMT for linear and quadratic programming. Zbl 0852.90105
Anstreicher, Kurt M.
1996
A note on the augmented Hessian when the reduced Hessian is semidefinite. Zbl 1047.90040
Anstreicher, Kurt M.; Wright, Margaret H.
2000
Kronecker product constraints with an application to the two-trust-region subproblem. Zbl 1357.90105
Anstreicher, Kurt M.
2017
A strengthened acceptance criterion for approximate projections in Karmarkar’s algorithm. Zbl 0618.90055
Anstreicher, Kurt M.
1986
Improved linear programming bounds for antipodal spherical codes. Zbl 1175.90284
Anstreicher, Kurt M.
2002
On partial updating in a potential reduction linear programming algorithm of Kojima, Mizuno, and Yoshise. Zbl 0764.90052
Bosch, Robert A.; Anstreicher, Kurt M.
1993
Maximum-entropy sampling and the Boolean quadric polytope. Zbl 1404.90097
Anstreicher, Kurt M.
2018
Continuous relaxations for constrained maximum-entropy sampling. Zbl 1415.90057
Anstreicher, Kurt M.; Fampa, Marcia; Lee, Jon; Williams, Joy
1996
Large step volumetric potential reduction algorithms for linear programming. Zbl 0848.90080
Anstreicher, Kurt M.
1996
Eigenvalue bounds versus semidefinite relaxations for the quadratic assignment problem. Zbl 0990.90099
Anstreicher, K. M.
2000
Volumetric path following algorithms for linear programming. Zbl 0881.90092
Anstreicher, Kurt M.
1997
A long-step path following algorithm for semidefinite programming problems. Zbl 0903.90126
Anstreicher, Kurt M.; Fampa, Marcia
1998
Strict monotonicity and improved complexity in the standard form projective algorithm for linear programming. Zbl 0795.90038
Anstreicher, Kurt M.
1993
Improved complexity for maximum volume inscribed ellipsoids. Zbl 1026.90067
Anstreicher, Kurt M.
2002
On monotonicity in the scaled potential algorithm for linear programming. Zbl 0728.65058
Anstreicher, Kurt M.
1991
The Steinberg wiring problem. Zbl 1107.90429
Brixius, Nathan W.; Anstreicher, Kurt M.
2004
Maximum-entropy remote sampling. Zbl 0962.62006
Anstreicher, Kurt M.; Fampa, Marcia; Lee, Jon; Williams, Joy
2001
Potential reduction algorithms. Zbl 0876.90066
Anstreicher, Kurt M.
1996
The volumetric barrier for convex quadratic constraints. Zbl 1070.90084
Anstreicher, Kurt M.
2004
Quadratic programs with hollows. Zbl 1401.90147
Yang, Boshi; Anstreicher, Kurt; Burer, Samuel
2018
Maximum-entropy sampling and the Boolean quadric polytope. Zbl 1404.90097
Anstreicher, Kurt M.
2018
Kronecker product constraints with an application to the two-trust-region subproblem. Zbl 1357.90105
Anstreicher, Kurt M.
2017
Second-order-cone constraints for extended trust-region subproblems. Zbl 1298.90062
Burer, Samuel; Anstreicher, Kurt M.
2013
Separating doubly nonnegative and completely positive matrices. Zbl 1263.90064
Dong, Hongbo; Anstreicher, Kurt
2013
Geometric conditions for Euclidean Steiner trees in $$\mathbb R^d$$. Zbl 1277.65014
Van Laarhoven, Jon W.; Anstreicher, Kurt M.
2013
On convex relaxations for quadratically constrained quadratic programming. Zbl 1267.90103
Anstreicher, Kurt M.
2012
Interior-point algorithms for a generalization of linear programming and weighted centring. Zbl 1254.90106
Anstreicher, Kurt M.
2012
Computable representations for convex hulls of low-dimensional quadratic forms. Zbl 1198.90311
Anstreicher, Kurt M.; Burer, Samuel
2010
A note on “$$5\times 5$$ completely positive matrices”. Zbl 1191.15027
Dong, Hongbo; Anstreicher, Kurt
2010
Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming. Zbl 1169.90425
Anstreicher, Kurt M.
2009
The difference between $$5\times 5$$ doubly nonnegative and completely positive matrices. Zbl 1175.15026
Burer, Samuel; Anstreicher, Kurt M.; Dür, Mirjam
2009
Two “well-known” properties of subgradient optimization. Zbl 1180.90179
Anstreicher, Kurt M.; Wolsey, Laurence A.
2009
An improved algorithm for computing Steiner minimal trees in Euclidean $$d$$-space. Zbl 1152.90663
Fampa, Marcia; Anstreicher, Kurt M.
2008
D.C. versus copositive bounds for standard QP. Zbl 1093.90033
Anstreicher, Kurt M.; Burer, Samuel
2005
The thirteen spheres: a new proof. Zbl 1126.52017
Anstreicher, Kurt M.
2004
The Steinberg wiring problem. Zbl 1107.90429
Brixius, Nathan W.; Anstreicher, Kurt M.
2004
The volumetric barrier for convex quadratic constraints. Zbl 1070.90084
Anstreicher, Kurt M.
2004
Recent advances in the solution of quadratic assignment problems. Zbl 1035.90067
Anstreicher, Kurt M.
2003
Solving large quadratic assignment problems on computational grids. Zbl 1030.90105
Anstreicher, Kurt; Brixius, Nathan; Goux, Jean-Pierre; Linderoth, Jeff
2002
Improved linear programming bounds for antipodal spherical codes. Zbl 1175.90284
Anstreicher, Kurt M.
2002
Improved complexity for maximum volume inscribed ellipsoids. Zbl 1026.90067
Anstreicher, Kurt M.
2002
A new bound for the quadratic assignment problem based on convex quadratic programming. Zbl 0986.90042
Anstreicher, Kurt M.; Brixius, Nathan W.
2001
Solving quadratic assignment problems using convex quadratic programming relaxations. Zbl 0991.90107
Brixius, Nathan W.; Anstreicher, Kurt M.
2001
Maximum-entropy remote sampling. Zbl 0962.62006
Anstreicher, Kurt M.; Fampa, Marcia; Lee, Jon; Williams, Joy
2001
On Lagrangian relaxation of quadratic matrix constraints. Zbl 0990.90088
Anstreicher, Kurt; Wolkowicz, Henry
2000
The volumetric barrier for semidefinite programming. Zbl 1073.90533
Anstreicher, Kurt M.
2000
A note on the augmented Hessian when the reduced Hessian is semidefinite. Zbl 1047.90040
Anstreicher, Kurt M.; Wright, Margaret H.
2000
Eigenvalue bounds versus semidefinite relaxations for the quadratic assignment problem. Zbl 0990.90099
Anstreicher, K. M.
2000
Linear programming in $$O([n^3/\ln n]L)$$ operations. Zbl 0955.90085
Anstreicher, K. M.
1999
Strong duality for a trust-region type relaxation of the quadratic assignment problem. Zbl 0953.90034
Anstreicher, Kurt; Chen, Xin; Wolkowicz, Henry; Yuan, Yaxiang
1999
Probabilistic analysis of an infeasible-interior-point algorithm for linear programming. Zbl 0977.90019
Anstreicher, Kurt M.; Ji, Jun; Potra, Florian A.; Ye, Yinyu
1999
Using continuous nonlinear relaxations to solve constrained maximum-entropy sampling problems. Zbl 0954.90048
Anstreicher, Kurt M.; Fampa, Marcia; Lee, Jon; Williams, Joy
1999
Ellipsoidal approximations of convex sets based on the volumetric barrier. Zbl 0977.90034
Anstreicher, K. M.
1999
Towards a practical volumetric cutting plane method for convex programming. Zbl 1032.90525
Anstreicher, Kurt M.
1998
A long-step path following algorithm for semidefinite programming problems. Zbl 0903.90126
Anstreicher, Kurt M.; Fampa, Marcia
1998
On Vaidya’s volumetric cutting plane method for convex programming. Zbl 0871.90061
Anstreicher, Kurt M.
1997
Volumetric path following algorithms for linear programming. Zbl 0881.90092
Anstreicher, Kurt M.
1997
On long step path following and SUMT for linear and quadratic programming. Zbl 0852.90105
Anstreicher, Kurt M.
1996
Continuous relaxations for constrained maximum-entropy sampling. Zbl 1415.90057
Anstreicher, Kurt M.; Fampa, Marcia; Lee, Jon; Williams, Joy
1996
Large step volumetric potential reduction algorithms for linear programming. Zbl 0848.90080
Anstreicher, Kurt M.
1996
Potential reduction algorithms. Zbl 0876.90066
Anstreicher, Kurt M.
1996
A new infinity-norm path following algorithm for linear programming. Zbl 0834.90084
Anstreicher, Kurt M.; Bosch, Robert A.
1995
A monotonic build-up simplex algorithm for linear programming. Zbl 0810.90089
Anstreicher, Kurt M.; Terlaky, Tamás
1994
On quadratic and $$O(\sqrt{n}L)$$ convergence of a predictor-corrector algorithm for LCP. Zbl 0799.90111
Ye, Yinyu; Anstreicher, Kurt
1993
A long-step barrier method for convex quadratic programming. Zbl 0783.90093
Anstreicher, K. M.; den Hertog, D.; Roos, C.; Terlaky, T.
1993
Average performance of a self-dual interior point algorithm for linear programming. Zbl 0968.90519
Anstreicher, Kurt M.; Ji, Jun; Potra, Florian A.; Ye, Yinyu
1993
A family of search directions for Karmarkar’s algorithm. Zbl 0782.90065
Anstreicher, Kurt M.; Watteyne, Patrick
1993
On partial updating in a potential reduction linear programming algorithm of Kojima, Mizuno, and Yoshise. Zbl 0764.90052
Bosch, Robert A.; Anstreicher, Kurt M.
1993
Strict monotonicity and improved complexity in the standard form projective algorithm for linear programming. Zbl 0795.90038
Anstreicher, Kurt M.
1993
Long steps in an $$O(n^ 3L)$$ algorithm for linear programming. Zbl 0783.90066
Anstreicher, Kurt M.; Bosch, Robert A.
1992
Crashing a maximum-weight complementary basis. Zbl 0764.90082
Anstreicher, Kurt M.; Lee, Jon; Rutherford, Thomas F.
1992
On interior algorithms for linear programming with no regularity assumptions. Zbl 0760.90068
Anstreicher, Kurt M.
1992
A combined phase I-phase II scaled potential algorithm for linear programming. Zbl 0747.90060
Anstreicher, Kurt M.
1991
On the performance of Karmarkar’s algorithm over a sequence of iterations. Zbl 0752.90044
Anstreicher, Kurt M.
1991
On monotonicity in the scaled potential algorithm for linear programming. Zbl 0728.65058
Anstreicher, Kurt M.
1991
A standard form variant, and safeguarded linesearch, for the modified Karmarkar algorithm. Zbl 0708.90046
Anstreicher, Kurt M.
1990
A combined phase I-phase II projective algorithm for linear programming. Zbl 0662.90048
Anstreicher, Kurt M.
1989
The worst-case step in Karmarkar’s algorithm. Zbl 0674.90060
Anstreicher, Kurt M.
1989
Linear programming and the Newton barrier flow. Zbl 0657.90059
Anstreicher, Kurt M.
1988
Using Gauss-Jordan elimination to compute the index, generalized nullspaces, and Drazin inverse. Zbl 0613.65028
Anstreicher, Kurt M.; Rothblum, Uriel G.
1987
A monotonic projective algorithm for fractional linear programming. Zbl 0625.90088
Anstreicher, Kurt M.
1986
A strengthened acceptance criterion for approximate projections in Karmarkar’s algorithm. Zbl 0618.90055
Anstreicher, Kurt M.
1986
all top 5

Cited by 729 Authors

 19 Anstreicher, Kurt M. 19 Burer, Samuel 16 Terlaky, Tamás 15 Locatelli, Marco 14 Ye, Yinyu 13 Potra, Florian-Alexandru 13 Todd, Michael J. 12 Salahi, Maziar 11 Deng, Zhibin 10 Xia, Yong 9 Bomze, Immanuel M. 9 Illés, Tibor 9 Sotirov, Renata 9 Wolkowicz, Henry 8 Fang, Shu-Cherng 8 Jódar Sanchez, Lucas Antonio 8 Lu, Cheng 8 Roos, Cornelis 7 Freund, Robert M. 7 Hahn, Peter M. 7 Li, Duan 7 Mitchell, John E. 7 Peng, Jiming 6 Fampa, Marcia Helena C. 6 Floudas, Christodoulos Achilleus 6 Gonzaga, Clovis C. 6 Jin, Qingwei 6 Lee, Jon 6 Letchford, Adam N. 6 Misener, Ruth 6 Vial, Jean-Philippe 5 de Klerk, Etienne 5 den Hertog, Dick 5 Dong, Hongbo 5 Guignard, Monique 5 Kojima, Masakazu 5 Tian, Ye 5 Xing, Wenxun 5 Zhao, Gongyun 4 Anjos, Miguel F. 4 Ariyawansa, K. A. 4 Atamtürk, Alper 4 Dalkiran, Evrim 4 Frangioni, Antonio 4 Goldfarb, Donald 4 Guo, Xiaoling 4 Jiang, Rujun 4 Liberti, Leo 4 Mehrotra, Sanjay 4 Mizuno, Shinji 4 Musin, Oleg R. 4 Paparrizos, Konstantinos 4 Sim, Chee-Khian 4 Takeda, Akiko 4 Tarasov, Alexey S. 4 Vannelli, Anthony 4 Zhang, Shuzhong 4 Zhu, Yi-Rong 4 Zuluaga, Luis Fernando 3 Beck, Amir 3 Berezovskij, O. A. 3 Bienstock, Daniel 3 Buchheim, Christoph 3 Csizmadia, Zsolt 3 Dickinson, Peter J. C. 3 Drezner, Zvi 3 Dür, Mirjam 3 Galli, Laura 3 Güler, Osman 3 Jarre, Florian 3 Jeyakumar, Vaithilingam 3 Kaliski, John A. 3 Kheirfam, Behrouz 3 Li, Guoyin 3 Liu, Hongwei 3 Luo, Hezhi 3 Mitrouli, Marilena 3 Monteiro, Renato D. C. 3 Morera, José Luis 3 Navarro, Enrique A. 3 Nebe, Gabriele 3 Nemirovski, Arkadi S. 3 Nesterov, Yurii 3 Pang, Jong-Shi 3 Povh, Janez 3 Qi, Liqun 3 Samaras, Nikolaos 3 Sheng, Xingping 3 Sherali, Hanif D. 3 Sheu, Ruey-Lin 3 Sun, Jie 3 Tawarmalani, Mohit 3 Teboulle, Marc 3 Traversi, Emiliano 3 Tsuchiya, Takashi 3 Tunçel, Levent 3 Venkov, Boris B. 3 Yang, Boshi 3 Yoshise, Akiko 3 Zheng, Hua ...and 629 more Authors
all top 5

Cited in 108 Serials

 110 Mathematical Programming. Series A. Series B 42 Journal of Global Optimization 30 European Journal of Operational Research 24 Journal of Optimization Theory and Applications 24 Computational Optimization and Applications 22 SIAM Journal on Optimization 21 Operations Research Letters 21 Optimization Letters 20 Linear Algebra and its Applications 18 Annals of Operations Research 15 Computers & Operations Research 13 Optimization Methods & Software 11 Discrete Applied Mathematics 11 INFORMS Journal on Computing 9 Optimization 8 Mathematical Programming Computation 7 Applied Mathematics and Computation 7 Discrete Optimization 5 Computers & Mathematics with Applications 5 Algorithmica 4 Mathematical Programming 4 Computational and Applied Mathematics 4 International Transactions in Operational Research 4 Journal of Industrial and Management Optimization 3 Journal of Computational and Applied Mathematics 3 Operations Research 3 European Journal of Combinatorics 3 Applied Numerical Mathematics 3 Journal of Complexity 3 SIAM Journal on Matrix Analysis and Applications 3 Numerical Algorithms 3 Cybernetics and Systems Analysis 3 Mathematical Problems in Engineering 3 Mathematical Methods of Operations Research 3 Journal of Combinatorial Optimization 3 RAIRO. Operations Research 3 EURO Journal on Computational Optimization 3 Journal of the Operations Research Society of China 2 International Journal of Mathematical Education in Science and Technology 2 Journal of Mathematical Analysis and Applications 2 Automatica 2 Journal of Information & Optimization Sciences 2 Machine Learning 2 Journal of Heuristics 2 CEJOR. Central European Journal of Operations Research 2 Foundations of Computational Mathematics 2 Journal of Applied Mathematics and Computing 2 4OR 2 Numerical Algebra, Control and Optimization 1 Applicable Analysis 1 Journal of the Franklin Institute 1 Journal of Statistical Physics 1 Linear and Multilinear Algebra 1 Periodica Mathematica Hungarica 1 Mathematics of Computation 1 Acta Mathematica Vietnamica 1 Applied Mathematics and Optimization 1 Calcolo 1 Numerische Mathematik 1 SIAM Journal on Control and Optimization 1 Statistica Neerlandica 1 Theoretical Computer Science 1 Acta Mathematicae Applicatae Sinica. English Series 1 Discrete & Computational Geometry 1 Journal of Economic Dynamics & Control 1 Applied Mathematics Letters 1 Trabajos de Investigacion Operativa 1 Science in China. Series A 1 Formal Aspects of Computing 1 International Journal of Foundations of Computer Science 1 Applications of Mathematics 1 Computer Science in Economics and Management 1 International Journal of Computer Mathematics 1 Pattern Recognition 1 Expositiones Mathematicae 1 ZOR. Zeitschrift für Operations Research 1 International Journal of Robust and Nonlinear Control 1 International Journal of Bifurcation and Chaos in Applied Sciences and Engineering 1 Experimental Mathematics 1 Formal Methods in System Design 1 Journal de Théorie des Nombres de Bordeaux 1 Journal of Mathematical Sciences (New York) 1 Journal of Inverse and Ill-Posed Problems 1 ETNA. Electronic Transactions on Numerical Analysis 1 Top 1 European Series in Applied and Industrial Mathematics (ESAIM): Control, Optimization and Calculus of Variations 1 Nonlinear Dynamics 1 Vietnam Journal of Mathematics 1 Taiwanese Journal of Mathematics 1 Journal of Applied Mathematics and Decision Sciences 1 Acta Mathematica Sinica. English Series 1 Dynamical Systems 1 Journal of Applied Mathematics 1 Journal of Machine Learning Research (JMLR) 1 OR Spectrum 1 Computational Management Science 1 International Journal of Number Theory 1 Proceedings of the Steklov Institute of Mathematics 1 Asian-European Journal of Mathematics 1 Pesquisa Operacional ...and 8 more Serials
all top 5

Cited in 28 Fields

 514 Operations research, mathematical programming (90-XX) 94 Numerical analysis (65-XX) 33 Linear and multilinear algebra; matrix theory (15-XX) 29 Computer science (68-XX) 24 Calculus of variations and optimal control; optimization (49-XX) 15 Combinatorics (05-XX) 13 Convex and discrete geometry (52-XX) 12 Statistics (62-XX) 7 Probability theory and stochastic processes (60-XX) 7 Game theory, economics, finance, and other social and behavioral sciences (91-XX) 6 Systems theory; control (93-XX) 4 Ordinary differential equations (34-XX) 4 Biology and other natural sciences (92-XX) 3 Number theory (11-XX) 3 Partial differential equations (35-XX) 2 Differential geometry (53-XX) 2 Mechanics of particles and systems (70-XX) 1 General and overarching topics; collections (00-XX) 1 Algebraic geometry (14-XX) 1 Group theory and generalizations (20-XX) 1 Functions of a complex variable (30-XX) 1 Dynamical systems and ergodic theory (37-XX) 1 Difference and functional equations (39-XX) 1 Integral transforms, operational calculus (44-XX) 1 Functional analysis (46-XX) 1 Geometry (51-XX) 1 Statistical mechanics, structure of matter (82-XX) 1 Information and communication theory, circuits (94-XX)