Browsing eNauka
Browsing by Project [BR05236839]
Showing results 1 to 8 of 8
| Issue Date | Title | Author(s) | Type | Мp-cat. |
|---|---|---|---|---|
| 2020 | A non-triangular hub location problem | Brimberg, Jack; Mladenović, Nenad   ; Todosijević, Raca ; Urošević, Dragan | Article | 21M21 |
| 2019 | Continuous variable neighborhood search (C-VNS) for solving systems of nonlinear equations | Pei, Jun; Dražić, Zorica ; Dražić, Milan ; Mladenović, Nenad ; Pardalos, Panos M. | Article | 22M22 |
| 2020 | Less is more approach: basic variable neighborhood search for the obnoxious p-median problem | Mladenović, Nenad ; Alkandari, Abdulaziz; Pei, Jun; Todosijević, Raca ; Pardalos, Panos | Article | 21M21 |
| 2019 | Less is more: Tabu search for bipartite quadratic programming problem | Urošević, Dragan ; Alghoul, Yiad Ibrahim Yousef; Amirgaliyeva, Zhazira; Mladenović, Nenad | Conference Paper | Mp. category will be shown later |
| 2018 | Maximum independent set in planning freight railway transportation | Damir, Gainanov N; Mladenovic, Nenad M; Rasskazova, VA | Article | Mp. category will be shown later |
| 2020 | Solving the traveling repairman problem with profits: A Novel variable neighborhood search approach | Pei, Jun; Mladenović, Nenad ; Urošević, Dragan ; Brimberg, Jack; Liu, Xinbao | Article | 21a+M21a+ |
| 2019 | Variable Neighborhood Search for a Two-Stage Stochastic Programming Problem with a Quantile Criterion | Ivanov, Sergey; Kibzun, Andrey; Mladenović, Nenad | Article | 23M23 |
| 2019 | VNDS for the min-power symmetric connectivity problem | Plotnikov, Roman; Erzin, Adil; Mladenović, Nenad | Article | 21M21 |