Researchers
Mladenović, Nenad
Results 41-60 of 268
| Issue Date | Title | Author(s) | Type | Мp-cat. |
|---|---|---|---|---|
| 2017 | On the aircraft conflict resolution problem: A VNS approach in a multiobjective framework | Alonso-Ayuso, Antonio; Escudero, Laureano; Javier Martín-Campo,; Mladenović, Nenad | Article | Mp. category will be shown later |
| 2017 | New VNP for automatic programming | Elleuch, Souhir; Hansen, Pierre; Jarboui, Bassem; Mladenović, Nenad | Article | Mp. category will be shown later |
| 2017 | Solving multifacility Huff location models on networks using metaheuristic and exact approaches | Grohmann, Sanja; Urošević, Dragan | Article | 21M21 |
| 2017 | Less is more: Solving the Max-Mean diversity problem with variable neighborhood search | Brimberg, Jack; Mladenović, Nenad | Article | 21a+M21a+ |
| 2017 | Solving the capacitated clustering problem with variable neighborhood search | Brimberg, Jack; Mladenović, Nenad | Article | 22M22 |
| 2017 | Variable neighborhood formulation search approach for the multi-item capacitated lot-sizing problem with time windows and setup times | Erromdhani, Ridha; Jarboui, Bassem; Eddaly, Mansour; Rebai, Abdelwaheb; Mladenović, Nenad | Article | Mp. category will be shown later |
| 2017 | A heuristic hybrid framework for vector job scheduling | Lawrance, Nareyus; Lucas, Cormac; Mladenović, Nenad | Article | 24+M24+ |
| 2017 | Scheduling preventive railway maintenance activities with resource constraints | Macedo, Rita; Benmansour, Rachid; Artiba, Abdelhakim; Mladenović, Nenad | Article | Mp. category will be shown later |
| 2017 | A general framework for nested variable neighborhood search | Brimberg, Jack; Mladenović, Nenad | Conference Paper | Mp. category will be shown later |
| 2017 | On Strategies to Fix Degenerate k-means Solutions | Aloise, Daniel; Damasceno, Nielsen Castelo; Mladenović, Nenad | Article | 21aM21a |
| 2017 | A performance study on multi improvement neighborhood search strategy | Rios, Eyder; Ochi, Luiz Satoru; Boeres, Cristina; Coelho, Igor; Coelho, Vitor; Mladenović, Nenad | Article | Mp. category will be shown later |
| 2017 | Sequential variable neighborhood descent variants: an empirical study on the traveling salesman problem | Mjirda, Anis; Todosijević, Raca | Article | 21M21 |
| 2017 | Solving the maximum min-sum dispersion by alternating formulations of two different problems | Amirgaliyeva, Zhazira; Mladenović, Nenad | Article | 21aM21a |
| 2017 | Comparison of metaheuristics for the k-labeled spanning forest problem | Consoli, Sergio; Moreno Pérez, José Andrés; Mladenović, Nenad | Article | 21M21 |
| 2017 | NP-Hardness of balanced minimum sum-of-squares clustering | Pyatkin, Artem; Aloise, Daniel; Mladenović, Nenad | Article | 22M22 |
| 2017 | Using injection points in reformulation local search for solving continuous location problems | Brimberg, Jack; Drezner, Zvi; Mladenović, Nenad | Article | 24+M24+ |
| 2017 | Clustering approach in maintenance of capillary railway network | Đorić, Danijela; El Cadi, Abdessamad Ait; Hanafi, Saïd; Mladenović, Nenad | Article | Mp. category will be shown later |
| 2017 | Less is more: basic variable neighborhood search heuristic for balanced minimum sum-of-squares clustering | Costa, Leandro R.; Aloise, Daniel; Mladenović, Nenad | Article | 21a+M21a+ |
| 2017 | New MIP model for multiprocessor scheduling problem with communication delays | Ait El Cadi, Abdessamad; Ben Atitallah, Rabie; Hanafi, Saïd; Mladenović, Nenad | Article | 21M21 |
| 2017 | Variable neighborhood search variants for Min-power symmetric connectivity problem | Erzin, Adil; Mladenović, Nenad | Article | 21M21 |