| Year | Rank | Type | Title / Venue / Authors |
|---|---|---|---|
| 2025 | J | jnl |
EURO J. Comput. Optim.
|
| 2025 | J | jnl |
J. Glob. Optim.
|
| 2024 | J | jnl |
Optim. Lett.
|
| 2024 | J | jnl |
J. Optim. Theory Appl.
|
| 2024 | J | jnl |
J. Optim. Theory Appl.
|
| 2022 | J | jnl |
J. Optim. Theory Appl.
|
| 2022 | J | jnl |
Eur. J. Oper. Res.
|
| 2021 | J | jnl |
J. Optim. Theory Appl.
|
| 2021 | J | jnl |
Optim. Lett.
|
| 2020 | J | jnl |
J. Optim. Theory Appl.
|
| 2019 | J | jnl |
J. Approx. Theory
|
| 2018 | J | jnl |
Eur. J. Oper. Res.
|
| 2018 | J | jnl |
SIAM J. Optim.
|
| 2018 | J | jnl |
J. Glob. Optim.
|
| 2018 | J | jnl |
J. Glob. Optim.
|
| 2018 | J | jnl |
Guaranteeing highly robust weakly efficient solutions for uncertain multi-objective convex programs.
Eur. J. Oper. Res.
|
| 2017 | J | jnl |
Oper. Res. Lett.
|
| 2017 | J | jnl |
J. Optim. Theory Appl.
|
| 2017 | J | jnl |
Oper. Res. Lett.
|
| 2017 | J | jnl |
Appl. Math. Comput.
|
| 2017 | J | jnl |
J. Optim. Theory Appl.
|
| 2017 | J | jnl |
J. Optim. Theory Appl.
|
| 2016 | J | jnl |
Convergent Semidefinite Programming Relaxations for Global Bilevel Polynomial Optimization Problems.
SIAM J. Optim.
|
| 2016 | J | jnl |
J. Glob. Optim.
|
| 2016 | J | jnl |
Oper. Res. Lett.
|
| 2016 | J | jnl |
J. Glob. Optim.
|
| 2015 | J | jnl |
A bilevel Farkas lemma to characterizing global solutions of a class of bilevel polynomial programs.
Oper. Res. Lett.
|
| 2015 | J | jnl |
J. Optim. Theory Appl.
|
| 2015 | J | jnl |
Optim. Lett.
|
| 2015 | J | jnl |
Eur. J. Oper. Res.
|
| 2014 | J | jnl |
Oper. Res. Lett.
|
| 2014 | J | jnl |
J. Optim. Theory Appl.
|
| 2014 | J | jnl |
J. Glob. Optim.
|
| 2014 | J | jnl |
J. Optim. Theory Appl.
|
| 2014 | J | jnl |
SIAM J. Optim.
|
| 2014 | J | jnl |
Math. Program.
|
| 2013 | J | jnl |
Math. Program.
|
| 2013 | J | jnl |
J. Glob. Optim.
|
| 2013 | J | jnl |
Eur. J. Oper. Res.
|
| 2012 | J | jnl |
Oper. Res. Lett.
|
| 2011 | J | jnl |
Oper. Res. Lett.
|
| 2011 | J | jnl |
Math. Program.
|
| 2011 | J | jnl |
J. Glob. Optim.
|
| 2011 | J | jnl |
J. Optim. Theory Appl.
|
| 2010 | J | jnl |
Oper. Res. Lett.
|
| 2010 | J | jnl |
Eur. J. Oper. Res.
|
| 2010 | J | jnl |
Eur. J. Oper. Res.
|
| 2010 | J | jnl |
SIAM J. Optim.
|
| 2009 | J | jnl |
Appl. Math. Lett.
|
| 2009 | J | jnl |
SIAM J. Optim.
|
| 2009 | J | jnl |
Optim. Lett.
|
| 2009 | J | jnl |
Eur. J. Oper. Res.
|
| 2009 | J | jnl |
Optim. Lett.
|
| 2008 | J | jnl |
Math. Program.
|
| 2008 | J | jnl |
Optim. Lett.
|
| 2008 | J | jnl |
RAIRO Oper. Res.
|
| 2007 | J | jnl |
Asia Pac. J. Oper. Res.
|
| 2007 | J | jnl |
Non-convex quadratic minimization problems with quadratic constraints: global optimality conditions.
Math. Program.
|
| 2006 | J | jnl |
Eur. J. Oper. Res.
|
| 2006 | J | jnl |
J. Glob. Optim.
|
| 2006 | J | jnl |
Optim. Methods Softw.
|
| 2006 | J | jnl |
J. Glob. Optim.
|
| 2006 | J | jnl |
J. Glob. Optim.
|
| 2005 | J | jnl |
Math. Program.
|
| 2005 | J | jnl |
J. Approx. Theory
|
| 2004 | J | jnl |
SIAM J. Optim.
|
| 2003 | J | jnl |
SIAM J. Optim.
|
| 2002 | J | jnl |
Math. Program.
|
| 2002 | J | jnl |
SIAM J. Optim.
|
| 2000 | J | jnl |
SIAM J. Optim.
|
| 1999 | J | jnl |
Math. Program.
|
| 1997 | J | jnl |
J. Glob. Optim.
|
| 1996 | J | jnl |
J. Glob. Optim.
|
| 1996 | J | jnl |
SIAM J. Optim.
|
| 1995 | J | jnl |
Math. Oper. Res.
|
| 1994 | J | jnl |
Math. Program.
|
| 1993 | J | jnl |
ZOR Methods Model. Oper. Res.
|
| 1993 | J | jnl |
Math. Program.
|
| 1992 | J | jnl |
Math. Program.
|
| 1991 | J | jnl |
SIAM J. Optim.
|
| 1984 | J | jnl |
Z. Oper. Research
|