| Year | Rank | Type | Title / Venue / Authors |
|---|---|---|---|
| 2025 | J | jnl |
Appl. Math. Comput.
|
| 2025 | J | jnl |
J. Optim. Theory Appl.
|
| 2023 | J | jnl |
Expert Syst. Appl.
|
| 2021 | J | jnl |
Comput. Oper. Res.
|
| 2021 | J | jnl |
J. Glob. Optim.
|
| 2020 | J | jnl |
Math. Methods Oper. Res.
|
| 2019 | J | jnl |
Optim. Methods Softw.
|
| 2019 | J | jnl |
Central Eur. J. Oper. Res.
|
| 2019 | J | jnl |
Oper. Res. Lett.
|
| 2018 | J | jnl |
J. Glob. Optim.
|
| 2017 | J | jnl |
Oper. Res. Lett.
|
| 2017 | J | jnl |
J. Glob. Optim.
|
| 2015 | J | jnl |
Mach. Learn.
|
| 2015 | — | conf |
MCO (1)
|
| 2015 | — | conf |
MCO (1)
|
| 2014 | J | jnl |
J. Glob. Optim.
|
| 2013 | J | jnl |
J. Glob. Optim.
|
| 2013 | J | jnl |
J. Glob. Optim.
|
| 2012 | J | jnl |
Comput. Oper. Res.
|
| 2011 | J | jnl |
A two-objective mathematical model without cutting patterns for one-dimensional assortment problems.
J. Comput. Appl. Math.
|
| 2010 | J | jnl |
SIAM J. Optim.
|
| 2009 | J | jnl |
INFOR Inf. Syst. Oper. Res.
|
| 2009 | J | jnl |
SIAM J. Optim.
|