| Year | Rank | Type | Title / Venue / Authors |
|---|---|---|---|
| 2026 | J | jnl |
Eur. J. Oper. Res.
|
| 2025 | J | jnl |
IEEE Trans. Intell. Transp. Syst.
|
| 2025 | J | jnl |
CoRR
|
| 2025 | J | jnl |
J. Optim. Theory Appl.
|
| 2024 | J | jnl |
CoRR
|
| 2024 | — | conf |
ITSC
|
| 2024 | J | jnl |
INFOR Inf. Syst. Oper. Res.
|
| 2024 | J | jnl |
Networks
|
| 2023 | J | jnl |
INFORMS J. Comput.
|
| 2023 | J | jnl |
CoRR
|
| 2023 | J | jnl |
SIAM J. Optim.
|
| 2022 | J | jnl |
IEEE Trans. Intell. Transp. Syst.
|
| 2022 | J | jnl |
IEEE Internet Things J.
|
| 2022 | J | jnl |
CoRR
|
| 2022 | J | jnl |
CoRR
|
| 2021 | — | conf |
NeurIPS (Competition and Demos)
|
| 2021 | J | jnl |
Eur. J. Oper. Res.
|
| 2021 | J | jnl |
CoRR
|
| 2020 | J | jnl |
CoRR
|
| 2020 | J | jnl |
IEEE Trans. Ind. Informatics
|
| 2019 | J | jnl |
EURO J. Comput. Optim.
|
| 2019 | J | jnl |
Proc. IEEE
|
| 2019 | J | jnl |
CoRR
|
| 2019 | J | jnl |
Power transmission network expansion planning: A semidefinite programming branch-and-bound approach.
Eur. J. Oper. Res.
|
| 2018 | B | conf |
NOMS
|
| 2018 | J | jnl |
Eur. J. Oper. Res.
|
| 2018 | J | jnl |
INFORMS J. Comput.
|
| 2017 | J | jnl |
J. Oper. Res. Soc.
|
| 2017 | J | jnl |
Eur. J. Oper. Res.
|
| 2016 | J | jnl |
Math. Program.
|
| 2016 | J | jnl |
Eur. J. Oper. Res.
|
| 2015 | J | jnl |
Eur. J. Oper. Res.
|
| 2015 | J | jnl |
Eur. J. Oper. Res.
|
| 2015 | — | conf |
ITSC
|
| 2014 | J | jnl |
CoRR
|
| 2012 | J | jnl |
J. Oper. Res. Soc.
|
| 2011 | J | jnl |
Ann. Oper. Res.
|
| 2011 | B | conf |
IPCO
|
| 2011 | — | — |
|
| 2011 | J | jnl |
SIAM J. Optim.
|
| 2010 | J | jnl |
Ad Hoc Sens. Wirel. Networks
|
| 2006 | J | jnl |
Comput. Commun.
|
| 2005 | — | conf |
WiMob (2)
|