| Year | Rank | Type | Title / Venue / Authors |
|---|---|---|---|
| 2023 | J | jnl |
Eur. J. Oper. Res.
|
| 2023 | J | jnl |
Central Eur. J. Oper. Res.
|
| 2022 | J | jnl |
Algorithms
|
| 2021 | J | jnl |
Expert Syst. Appl.
|
| 2020 | J | jnl |
CoRR
|
| 2020 | J | jnl |
OR Spectr.
|
| 2020 | Misc | conf |
WSC
|
| 2019 | B | conf |
CPAIOR
|
| 2019 | J | jnl |
CoRR
|
| 2019 | C | conf |
EANN
|
| 2019 | J | jnl |
Math. Program. Comput.
|
| 2019 | — | conf |
OR
|
| 2019 | J | jnl |
CoRR
|
| 2019 | — | conf |
OR
|
| 2018 | — | conf |
OR
|
| 2018 | — | conf |
OR
|
| 2018 | — | conf |
IEEM
|
| 2018 | — | conf |
OR
|
| 2018 | J | jnl |
Eur. J. Oper. Res.
|
| 2018 | — | conf |
OR
|
| 2018 | — | conf |
OR
|
| 2017 | — | conf |
OR
|
| 2017 | J | jnl |
New semidefinite programming relaxations for the Linear Ordering and the Traveling Salesman Problem.
Discret. Appl. Math.
|
| 2017 | — | conf |
OR
|
| 2017 | — | conf |
OR
|
| 2017 | J | jnl |
J. Comb. Optim.
|
| 2016 | — | conf |
OR
|
| 2016 | — | conf |
OR
|
| 2015 | J | jnl |
SIAM J. Optim.
|
| 2015 | — | conf |
OR
|
| 2015 | J | jnl |
Optim. Lett.
|
| 2015 | J | jnl |
Eur. J. Oper. Res.
|
| 2014 | — | conf |
OR
|
| 2013 | — | conf |
MIM
|
| 2013 | J | jnl |
Comput. Optim. Appl.
|
| 2013 | J | jnl |
INFORMS J. Comput.
|
| 2013 | J | jnl |
J. Graph Algorithms Appl.
|
| 2013 | J | jnl |
Math. Program.
|
| 2012 | — | conf |
OR
|
| 2011 | A | conf |
ALENEX
|
| 2011 | J | jnl |
ACM J. Exp. Algorithmics
|