default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNenad Mladenovic
Person information
- affiliation: Serbian Academy of Sciences and Arts, Srbija, Serbia
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j168]Moustafa Abdelwanis
, Adriana F. Gabor, Nenad Mladenovic, Andrei Sleptchenko:
Simulation-based variable neighborhood search for optimizing skill assignments in multi-server facilities with inventories. Comput. Oper. Res. 164: 106546 (2024)- [j167]Ahmed Aly, Adriana F. Gabor, Nenad Mladenovic, Andrei Sleptchenko:
An efficient probability-based VNS algorithm for delivery territory design. Comput. Oper. Res. 170: 106756 (2024) - 2023
- [j166]Dalibor Ristic, Nenad Mladenovic, Mustapha Ratli, Raca Todosijevic, Dragan Urosevic:
Auxiliary data structures and techniques to speed up solving of the p-next center problem: A VNS heuristic. Appl. Soft Comput. 140: 110276 (2023) - [j165]Dalibor Ristic, Dragan Urosevic, Nenad Mladenovic, Raca Todosijevic:
Solving the p-second center problem with variable neighborhood search. Comput. Sci. Inf. Syst. 20(1): 95-115 (2023) - [j164]Jun Pei, Haoxin Wang, Min Kong, Nenad Mladenovic, Panos M. Pardalos:
Bi-level scheduling in high-end equipment R&D: when more algorithm strategies may not be better. Int. J. Prod. Res. 61(16): 5436-5467 (2023) - [j163]Alejandra Casado, Nenad Mladenovic, Jesús Sánchez-Oro, Abraham Duarte:
Variable neighborhood search approach with intensified shake for monitor placement. Networks 81(3): 319-333 (2023) - [j162]Nenad Mladenovic, Angelo Sifaleras, Andrei Sleptchenko:
Special issue dedicated to the 8th International Conference on Variable Neighborhood Search (ICVNS 2021). Optim. Lett. 17(9): 1979-1980 (2023) - [j161]Alberto Herrán, J. Manuel Colmenar, Nenad Mladenovic, Abraham Duarte:
A general variable neighborhood search approach for the minimum load coloring problem. Optim. Lett. 17(9): 2065-2086 (2023) - [j160]Issam Krimi, Rachid Benmansour, Raca Todosijevic, Nenad Mladenovic, Mustapha Ratli:
A no-delay single machine scheduling problem to minimize total weighted early and late work. Optim. Lett. 17(9): 2113-2131 (2023) - [j159]Issam Krimi, Rachid Benmansour, Raca Todosijevic, Nenad Mladenovic, Mustapha Ratli:
Correction to: A no-delay single machine scheduling problem to minimize total weighted early and late work. Optim. Lett. 17(9): 2133-2134 (2023) - [j158]Elias L. Marques, Vitor Nazário Coelho, Igor Machado Coelho, Luiz Satoru Ochi, Nelson Maculan, Nenad Mladenovic, Bruno N. Coelho:
A two-phase multi-objective metaheuristic for a green UAV grid routing problem. Optim. Lett. 17(9): 2233-2256 (2023) - [j157]Rustam Mussabayev, Nenad Mladenovic, Bassem Jarboui, Ravil Mussabayev:
How to Use K-means for Big Data Clustering? Pattern Recognit. 137: 109269 (2023) - 2022
- [j156]Nenad Mladenovic, Raca Todosijevic, Dragan Urosevic, Mustapha Ratli:
Solving the Capacitated Dispersion Problem with variable neighborhood search approaches: From basic to skewed VNS. Comput. Oper. Res. 139: 105622 (2022) - [j155]Sameh Al-Shihabi, Nenad Mladenovic:
A mixed integer linear programming model and a basic variable neighbourhood search algorithm for the repatriation scheduling problem. Expert Syst. Appl. 198: 116728 (2022) - [j154]Shaowen Lan, Wenjuan Fan, Shanlin Yang, Nenad Mladenovic, Panos M. Pardalos:
Solving a multiple-qualifications physician scheduling problem with multiple types of tasks by dynamic programming and variable neighborhood search. J. Oper. Res. Soc. 73(9): 2043-2058 (2022) - [j153]Nenad Mladenovic, Panos M. Pardalos, Angelo Sifaleras, Rachid Benmansour:
Preface to the special issue on variable neighborhood search. Optim. Lett. 16(1): 1-4 (2022) - [j152]Souhir Elleuch, Bassem Jarboui, Nenad Mladenovic, Jun Pei:
Variable neighborhood programming for symbolic regression. Optim. Lett. 16(1): 191-210 (2022) - [j151]Souhir Elleuch, Bassem Jarboui, Nenad Mladenovic:
Preventive maintenance planning of railway infrastructure by reduced variable neighborhood programming. Optim. Lett. 16(1): 237-253 (2022) - [j150]Mustapha Ratli, Dragan Urosevic, Abdessamad Ait El Cadi, Jack Brimberg, Nenad Mladenovic, Raca Todosijevic:
An efficient heuristic for a hub location routing problem. Optim. Lett. 16(1): 281-300 (2022) - [j149]Li Jiang, Xiaoning Zang, Junfeng Dong, Changyong Liang, Nenad Mladenovic:
A variable neighborhood search for the last-mile delivery problem during major infectious disease outbreak. Optim. Lett. 16(1): 333-353 (2022) - [j148]Nenad Mladenovic, Jun Pei, Panos M. Pardalos, Dragan Urosevic:
Less is more approach in optimization: a road to artificial intelligence. Optim. Lett. 16(1): 409-420 (2022) - [j147]Xiaoning Zang, Li Jiang, Changyong Liang, Junfeng Dong, Wenxing Lu, Nenad Mladenovic:
Optimization approaches for the urban delivery problem with trucks and drones. Swarm Evol. Comput. 75: 101147 (2022) - [c17]Alejandra Casado, Nenad Mladenovic, Jesús Sánchez-Oro, Abraham Duarte:
A Metaheuristic Approach for Solving Monitor Placement Problem. ICVNS 2022: 1-13 - [c16]Moustafa Abdelwanis, Nenad Mladenovic, Andrei Sleptchenko:
A Simulation-Based Variable Neighborhood Search Approach for Optimizing Cross-Training Policies. ICVNS 2022: 42-57 - [c15]Ahmed Aly, Adriana F. Gabor, Nenad Mladenovic:
An Effective VNS for Delivery Districting. ICVNS 2022: 69-81 - [c14]Conor Messer, Anup Teejo Mathew, Nenad Mladenovic, Federico Renda:
CTR DaPP: A Python Application for Design and Path Planning of Variable-strain Concentric Tube Robots. RoboSoft 2022: 14-20 - [i4]Rustam Mussabayev, Nenad Mladenovic, Bassem Jarboui, Ravil Mussabayev:
Big-means: Less is More for K-means Clustering. CoRR abs/2204.07485 (2022) - 2021
- [j146]Shaowen Lan, Wenjuan Fan, Shanlin Yang, Panos M. Pardalos, Nenad Mladenovic:
A survey on the applications of variable neighborhood search algorithm in healthcare management. Ann. Math. Artif. Intell. 89(8-9): 741-775 (2021) - [j145]Min Kong, Jin Xu, Tinglong Zhang, Shaojun Lu, Chang Fang, Nenad Mladenovic:
Energy-efficient rescheduling with time-of-use energy cost: Application of variable neighborhood search algorithm. Comput. Ind. Eng. 156: 107286 (2021) - [j144]Jack Brimberg, Raca Todosijevic, Dragan Urosevic, Nenad Mladenovic:
Efficient flow models for the uncapacitated multiple allocation p-hub median problem on non-triangular networks. Comput. Ind. Eng. 162: 107723 (2021) - [j143]Olzhas Kozbagarov, Rustam Mussabayev, Nenad Mladenovic:
A New Sentence-Based Interpretative Topic Modeling and Automatic Topic Labeling. Symmetry 13(5): 837 (2021) - [c13]Damir N. Gainanov, Nenad Mladenovic, Varvara Rasskazova:
Simplicial Vertex Heuristic in Solving the Railway Arrival and Departure Paths Assignment Problem. ICVNS 2021: 123-137 - [c12]Iskander Akhmetov, Nenad Mladenovic, Rustam Mussabayev:
Using K-Means and Variable Neighborhood Search for Automatic Summarization of Scientific Articles. ICVNS 2021: 166-175 - [e2]Nenad Mladenovic, Andrei Sleptchenko, Angelo Sifaleras, Mohammed A. Omar:
Variable Neighborhood Search - 8th International Conference, ICVNS 2021, Abu Dhabi, United Arab Emirates, March 21-25, 2021, Proceedings. Lecture Notes in Computer Science 12559, Springer 2021, ISBN 978-3-030-69624-5 [contents] - 2020
- [j142]Jun Pei, Nenad Mladenovic, Dragan Urosevic, Jack Brimberg, Xinbao Liu:
Solving the traveling repairman problem with profits: A Novel variable neighborhood search approach. Inf. Sci. 507: 108-123 (2020) - [j141]Dusan Dzamic, Jun Pei, Miroslav Maric, Nenad Mladenovic, Panos M. Pardalos:
Exponential quality function for community detection in complex networks. Int. Trans. Oper. Res. 27(1): 245-266 (2020) - [j140]Nenad Mladenovic, Abdulaziz Alkandari, Jun Pei, Raca Todosijevic, Panos M. Pardalos:
Less is more approach: basic variable neighborhood search for the obnoxious p-median problem. Int. Trans. Oper. Res. 27(1): 480-493 (2020) - [j139]Angelo Sifaleras, Nenad Mladenovic, Panos M. Pardalos:
Preface to the special issue "ICVNS 2018". J. Glob. Optim. 78(2): 239-240 (2020) - [j138]Vesna Radonjic Dogatovic, Marko Dogatovic, Milorad J. Stanojevic, Nenad Mladenovic:
Revenue maximization of Internet of things provider using variable neighbourhood search. J. Glob. Optim. 78(2): 375-396 (2020) - [j137]Min Kong, Xinbao Liu, Jun Pei, Panos M. Pardalos, Nenad Mladenovic:
Parallel-batching scheduling with nonlinear processing times on a single and unrelated parallel machines. J. Glob. Optim. 78(4): 693-715 (2020) - [j136]Jack Brimberg, Nenad Mladenovic, Raca Todosijevic, Dragan Urosevic:
A non-triangular hub location problem. Optim. Lett. 14(5): 1107-1126 (2020) - [j135]Shaojun Lu, Jun Pei, Xinbao Liu, Xiaofei Qian, Nenad Mladenovic, Panos M. Pardalos:
Less is more: variable neighborhood search for integrated production and assembly in smart manufacturing. J. Sched. 23(6): 649-664 (2020) - [e1]Rachid Benmansour, Angelo Sifaleras, Nenad Mladenovic:
Variable Neighborhood Search - 7th International Conference, ICVNS 2019, Rabat, Morocco, October 3-5, 2019, Revised Selected Papers. Lecture Notes in Computer Science 12010, Springer 2020, ISBN 978-3-030-44931-5 [contents]
2010 – 2019
- 2019
- [j134]Sergey V. Ivanov, Andrey I. Kibzun, Nenad Mladenovic:
Variable Neighborhood Search for a Two-Stage Stochastic Programming Problem with a Quantile Criterion. Autom. Remote. Control. 80(1): 43-52 (2019) - [j133]Dusan Dzamic, Daniel Aloise, Nenad Mladenovic:
Ascent-descent variable neighborhood decomposition search for community detection by modularity maximization. Ann. Oper. Res. 272(1-2): 273-287 (2019) - [j132]Jack Brimberg, Nenad Mladenovic, Raca Todosijevic, Dragan Urosevic:
Solving the capacitated clustering problem with variable neighborhood search. Ann. Oper. Res. 272(1-2): 289-321 (2019) - [j131]Jun Pei, Zorica Drazic, Milan Drazic, Nenad Mladenovic, Panos M. Pardalos:
Continuous Variable Neighborhood Search (C-VNS) for Solving Systems of Nonlinear Equations. INFORMS J. Comput. 31(2): 235-250 (2019) - [j130]Sergey V. Ivanov, Andrey I. Kibzun, Nenad Mladenovic, Dragan Urosevic:
Variable neighborhood search for stochastic linear programming problem with quantile criterion. J. Glob. Optim. 74(3): 549-564 (2019) - [j129]Roman V. Plotnikov, Adil I. Erzin, Nenad Mladenovic:
VNDS for the min-power symmetric connectivity problem. Optim. Lett. 13(8): 1897-1911 (2019) - [c11]Dragan Urosevic, Yiad Ibrahim Yousef Alghoul, Zhazira Amirgaliyeva, Nenad Mladenovic:
Less Is More: Tabu Search for Bipartite Quadratic Programming Problem. MOTOR 2019: 390-401 - 2018
- [j128]Thiago Gouveia da Silva, Gilberto Farias de Sousa Filho, Igor A. M. Barbosa, Nenad Mladenovic, Lucídio dos Anjos F. Cabral, Luiz Satoru Ochi, Daniel Aloise:
Efficient heuristics for the minimum labeling global cut problem. Electron. Notes Discret. Math. 66: 23-30 (2018) - [c10]Rodrigo Randel, Daniel Aloise, Nenad Mladenovic, Pierre Hansen:
On the k-Medoids Model for Semi-supervised Clustering. ICVNS 2018: 13-27 - [c9]Vitor Nazário Coelho, Igor Machado Coelho, Nenad Mladenovic, Helena Ramalhinho, Luiz Satoru Ochi, Frederico G. Guimarães, Marcone J. F. Souza:
Less Is More: The Neighborhood Guided Evolution Strategies Convergence on Some Classic Neighborhood Operators. ICVNS 2018: 77-88 - [c8]Rachid Benmansour, Oliver Braun, Saïd Hanafi, Nenad Mladenovic:
Using a Variable Neighborhood Search to Solve the Single Processor Scheduling Problem with Time Restrictions. ICVNS 2018: 202-215 - [r3]Abraham Duarte, Jesús Sánchez-Oro, Nenad Mladenovic, Raca Todosijevic:
Variable Neighborhood Descent. Handbook of Heuristics 2018: 341-367 - [r2]Pierre Hansen, Nenad Mladenovic:
Variable Neighborhood Search. Handbook of Heuristics 2018: 759-787 - 2017
- [j127]Daniel Aloise, Nielsen Castelo Damasceno, Nenad Mladenovic, Daniel Nobre Pinheiro:
On Strategies to Fix Degenerate k-means Solutions. J. Classif. 34(2): 165-190 (2017) - [j126]Abraham Duarte, Nenad Mladenovic, Bassem Jarboui:
Special issue on Variable neighborhood search methods in business and engineering. Comput. Oper. Res. 78: 382-384 (2017) - [j125]Sanja Grohmann, Dragan Urosevic, Emilio Carrizosa, Nenad Mladenovic:
Solving multifacility Huff location models on networks using metaheuristic and exact approaches. Comput. Oper. Res. 78: 537-546 (2017) - [j124]Adil I. Erzin, Nenad Mladenovic, Roman V. Plotnikov:
Variable neighborhood search variants for Min-power symmetric connectivity problem. Comput. Oper. Res. 78: 557-563 (2017) - [j123]Pierre Hansen, Nenad Mladenovic, Raca Todosijevic, Saïd Hanafi:
Variable neighborhood search: basics and variants. EURO J. Comput. Optim. 5(3): 423-454 (2017) - [j122]Antonio Alonso-Ayuso, Laureano F. Escudero, Francisco Javier Martín-Campo, Nenad Mladenovic:
On the aircraft conflict resolution problem: A VNS approach in a multiobjective framework. Electron. Notes Discret. Math. 58: 151-158 (2017) - [j121]Jack Brimberg, Nenad Mladenovic, Raca Todosijevic, Dragan Urosevic:
A general framework for nested variable neighborhood search. Electron. Notes Discret. Math. 58: 159-166 (2017) - [j120]Souhir Elleuch, Pierre Hansen, Bassem Jarboui, Nenad Mladenovic:
New VNP for automatic programming. Electron. Notes Discret. Math. 58: 191-198 (2017) - [j119]Eyder Rios, Luiz Satoru Ochi, Cristina Boeres, Igor Machado Coelho, Vitor Nazário Coelho, Nenad Mladenovic:
A performance study on multi improvement neighborhood search strategy. Electron. Notes Discret. Math. 58: 199-206 (2017) - [j118]Rita Macedo, Rachid Benmansour, Abdelhakim Artiba, Nenad Mladenovic, Dragan Urosevic:
Scheduling preventive railway maintenance activities with resource constraints. Electron. Notes Discret. Math. 58: 215-222 (2017) - [j117]Danijela Doric, Abdessamad Ait El Cadi, Saïd Hanafi, Nenad Mladenovic, Abdelhakim Artiba:
Clustering approach in maintenance of capillary railway network. Electron. Notes Discret. Math. 58: 239-246 (2017) - [j116]Zhazira Amirgaliyeva, Nenad Mladenovic, Raca Todosijevic, Dragan Urosevic:
Solving the maximum min-sum dispersion by alternating formulations of two different problems. Eur. J. Oper. Res. 260(2): 444-459 (2017) - [j115]Jack Brimberg, Nenad Mladenovic, Raca Todosijevic, Dragan Urosevic:
Less is more: Solving the Max-Mean diversity problem with variable neighborhood search. Inf. Sci. 382-383: 179-200 (2017) - [j114]Leandro Rincon Costa, Daniel Aloise, Nenad Mladenovic:
Less is more: basic variable neighborhood search heuristic for balanced minimum sum-of-squares clustering. Inf. Sci. 415: 247-253 (2017) - [j113]Nenad Mladenovic, Angelo Sifaleras, Kenneth Sörensen:
Editorial to the Special Cluster on Variable Neighborhood Search, Variants and Recent Applications. Int. Trans. Oper. Res. 24(3): 507-508 (2017) - [j112]Sergio Consoli, José Andrés Moreno-Pérez, Nenad Mladenovic:
Comparison of metaheuristics for the k-labeled spanning forest problem. Int. Trans. Oper. Res. 24(3): 559-582 (2017) - [j111]Anis Mjirda, Raca Todosijevic, Saïd Hanafi, Pierre Hansen, Nenad Mladenovic:
Sequential variable neighborhood descent variants: an empirical study on the traveling salesman problem. Int. Trans. Oper. Res. 24(3): 615-633 (2017) - [j110]Nenad Mladenovic, Angelo Sifaleras, Kenneth Sörensen:
Special issue on "New trends in Variable Neighborhood Search". Int. Trans. Oper. Res. 24(3): 683 (2017) - [j109]Jack Brimberg, Nenad Mladenovic, Raca Todosijevic, Dragan Urosevic:
A basic variable neighborhood search heuristic for the uncapacitated multiple allocation p-hub center problem. Optim. Lett. 11(2): 313-327 (2017) - [j108]Alexey Nikolaev, Nenad Mladenovic, Raca Todosijevic:
J-means and I-means for minimum sum-of-squares clustering on networks. Optim. Lett. 11(2): 359-376 (2017) - [j107]Jack Brimberg, Nenad Mladenovic, Raca Todosijevic, Dragan Urosevic:
General variable neighborhood search for the uncapacitated single allocation p-hub center problem. Optim. Lett. 11(2): 377-388 (2017) - [j106]Nenad Mladenovic, Panos M. Pardalos, Gordana Savic:
Preface of special issue BALCOR. Optim. Lett. 11(6): 1025-1027 (2017) - [j105]Jesús Sánchez-Oro, Nenad Mladenovic, Abraham Duarte:
General Variable Neighborhood Search for computing graph separators. Optim. Lett. 11(6): 1069-1089 (2017) - [j104]Abdessamad Ait El Cadi, Rabie Ben Atitallah, Saïd Hanafi, Nenad Mladenovic, Abdelhakim Artiba:
New MIP model for multiprocessor scheduling problem with communication delays. Optim. Lett. 11(6): 1091-1107 (2017) - [j103]Raca Todosijevic, Dragan Urosevic, Nenad Mladenovic, Saïd Hanafi:
A general variable neighborhood search for solving the uncapacitated r-allocation p-hub median problem. Optim. Lett. 11(6): 1109-1121 (2017) - [j102]Jack Brimberg, Stefana Janicijevic, Nenad Mladenovic, Dragan Urosevic:
Solving the clique partitioning problem as a maximally diverse grouping problem. Optim. Lett. 11(6): 1123-1135 (2017) - [j101]Artem V. Pyatkin, Daniel Aloise, Nenad Mladenovic:
NP-Hardness of balanced minimum sum-of-squares clustering. Pattern Recognit. Lett. 97: 44-45 (2017) - 2016
- [j100]Zvi Drezner, Jack Brimberg, Nenad Mladenovic, Saïd Salhi:
New local searches for solving the multi-source Weber problem. Ann. Oper. Res. 246(1-2): 181-203 (2016) - [j99]Abdalla Elshaikh, Saïd Salhi, Jack Brimberg, Nenad Mladenovic, Becky Callaghan, Gábor Nagy:
An adaptive perturbation-based heuristic: An application to the continuous p-centre problem. Comput. Oper. Res. 75: 1-11 (2016) - [j98]Vitor Nazário Coelho, Igor Machado Coelho, Marcone J. F. Souza, Thays A. Oliveira, Luciano Perdigão Cota, Matheus Nohra Haddad, Nenad Mladenovic, Rodrigo César Pedrosa Silva, Frederico G. Guimarães:
Hybrid Self-Adaptive Evolution Strategies Guided by Neighborhood Structures for Combinatorial Optimization Problems. Evol. Comput. 24(4): 637-666 (2016) - [j97]Raca Todosijevic, Rachid Benmansour, Saïd Hanafi, Nenad Mladenovic, Abdelhakim Artiba:
Nested general variable neighborhood search for the periodic maintenance problem. Eur. J. Oper. Res. 252(2): 385-396 (2016) - [j96]Nenad Mladenovic, Raca Todosijevic, Dragan Urosevic:
Less is more: Basic variable neighborhood search for minimum differential dispersion problem. Inf. Sci. 326: 160-171 (2016) - [c7]Roman V. Plotnikov, Adil I. Erzin, Nenad Mladenovic:
Variable Neighborhood Search-Based Heuristics for Min-Power Symmetric Connectivity Problem in Wireless Networks. DOOR 2016: 220-232 - [c6]Jack Brimberg, Nenad Mladenovic, Raca Todosijevic, Dragan Urosevic:
Variable Neighborhood Descent for the Capacitated Clustering Problem. DOOR 2016: 336-349 - 2015
- [j95]Sergio Consoli, Nenad Mladenovic, José A. Moreno-Pérez:
Solving the minimum labelling spanning tree problem by intelligent optimization. Appl. Soft Comput. 28: 440-452 (2015) - [j94]Rita Macedo, Cláudio Alves, Saïd Hanafi, Bassem Jarboui, Nenad Mladenovic, Bruna Ramos, José M. Valério de Carvalho:
Skewed general variable neighborhood search for the location routing scheduling problem. Comput. Oper. Res. 61: 143-152 (2015) - [j93]Zvi Drezner, Jack Brimberg, Nenad Mladenovic, Saïd Salhi:
New heuristic algorithms for solving the planar p-median problem. Comput. Oper. Res. 62: 296-304 (2015) - [j92]B. S. Zhikharevich, O. V. Rusetskay, Nenad Mladenovic:
Clustering cities based on their development dynamics and Variable neigborhood search. Electron. Notes Discret. Math. 47: 213-220 (2015) - [j91]Jack Brimberg, Nenad Mladenovic, Dragan Urosevic:
Solving the maximally diverse grouping problem by skewed general variable neighborhood search. Inf. Sci. 295: 650-675 (2015) - [j90]Emilio Carrizosa, Abdulrahman Alguwaizani, Pierre Hansen, Nenad Mladenovic:
New heuristic for harmonic means clustering. J. Glob. Optim. 63(3): 427-443 (2015) - [j89]Rima Sheikh Rajab, Milan Drazic, Nenad Mladenovic, Pavle Mladenovic, Keming Yu:
Fitting censored quantile regression by variable neighborhood search. J. Glob. Optim. 63(3): 481-500 (2015) - [j88]Zvi Drezner, Jack Brimberg, Nenad Mladenovic, Saïd Salhi:
Solving the planar p-median problem by variable neighborhood and concentric searches. J. Glob. Optim. 63(3): 501-514 (2015) - [j87]Abraham Duarte, Juan José Pantrigo, Eduardo G. Pardo, Nenad Mladenovic:
Multi-objective variable neighborhood search: an application to combinatorial optimization problems. J. Glob. Optim. 63(3): 515-536 (2015) - [j86]Antonio Alonso-Ayuso, Laureano F. Escudero, Francisco Javier Martín-Campo, Nenad Mladenovic:
A VNS metaheuristic for solving the aircraft conflict detection and resolution problem by performing turn changes. J. Glob. Optim. 63(3): 583-596 (2015) - [i3]Sergio Consoli, Nenad Mladenovic, José A. Moreno-Pérez:
BVNS para el problema del bosque generador k-etiquetado. CoRR abs/1503.01376 (2015) - [i2]Sergio Consoli, José Andrés Moreno-Pérez, Nenad Mladenovic:
Towards an intelligent VNS heuristic for the k-labelled spanning forest problem. CoRR abs/1503.02009 (2015) - 2014
- [j85]Ivan A. Davydov, Yury A. Kochetov, Nenad Mladenovic, Dragan Urosevic:
Fast metaheuristics for the discrete (r|p)-centroid problem. Autom. Remote. Control. 75(4): 677-687 (2014) - [j84]Ivan A. Davydov, Yury A. Kochetov, Nenad Mladenovic, Dragan Urosevic:
Erratum to: "Fast metaheuristics for the discrete (r|p)-centroid problem". Autom. Remote. Control. 75(7): 1356 (2014) - [j83]Nenad Mladenovic, Saïd Salhi, Saïd Hanafi, Jack Brimberg:
Editorial. Comput. Oper. Res. 52: 147-148 (2014) - [j82]Darko Kovacevic, Nenad Mladenovic, Bratislav Petrovic, Pavle D. Milosevic:
DE-VNS: Self-adaptive Differential Evolution with crossover neighborhood search for continuous global optimization. Comput. Oper. Res. 52: 157-169 (2014) - [j81]Marko S. Djogatovic, Milorad J. Stanojevic, Nenad Mladenovic:
A variable neighborhood search particle filter for bearings-only target tracking. Comput. Oper. Res. 52: 192-202 (2014) - [j80]Anis Mjirda, Bassem Jarboui, Rita Macedo, Saïd Hanafi, Nenad Mladenovic:
A two phase variable neighborhood search for the multi-product inventory routing problem. Comput. Oper. Res. 52: 291-299 (2014) - [j79]Nenad Mladenovic, Raca Todosijevic, Dragan Urosevic:
Two level General variable neighborhood search for Attractive traveling salesman problem. Comput. Oper. Res. 52: 341-348 (2014) - [j78]Jack Brimberg, Zvi Drezner, Nenad Mladenovic, Saïd Salhi:
A new local search for continuous location problems. Eur. J. Oper. Res. 232(2): 256-265 (2014) - [p4]Sonia Cafieri, Pierre Hansen, Nenad Mladenovic:
Variable Neighborhood Search for Edge-Ratio Network Clustering. Examining Robustness and Vulnerability of Networked Systems 2014: 51-64 - [i1]Sergio Consoli, José Andrés Moreno-Pérez, Kenneth Darby-Dowman, Nenad Mladenovic:
Mejora de la exploracion y la explotacion de las heuristicas constructivas para el MLSTP. CoRR abs/1405.1980 (2014) - 2013
- [j77]Nenad Mladenovic, Dragan Urosevic, Saïd Hanafi:
Variable neighborhood search for the travelling deliveryman problem. 4OR 11(1): 57-73 (2013) - [j76]Eduardo G. Pardo, Nenad Mladenovic, Juan José Pantrigo, Abraham Duarte:
Variable Formulation Search for the Cutwidth Minimization Problem. Appl. Soft Comput. 13(5): 2242-2252 (2013) - [j75]Vladislav Maras, Jasmina Lazic, Tatjana Davidovic, Nenad Mladenovic:
Routing of barge container ships by mixed-integer programming heuristics. Appl. Soft Comput. 13(8): 3515-3528 (2013) - [j74]Nenad Mladenovic, Pierre Hansen, Jack Brimberg:
Sequential clustering with radius and split criteria. Central Eur. J. Oper. Res. 21(Supplement-1): 95-115 (2013) - [j73]Bassem Jarboui, Houda Derbel, Saïd Hanafi, Nenad Mladenovic:
Variable neighborhood search for location routing. Comput. Oper. Res. 40(1): 47-57 (2013) - [j72]Rym M'Hallah, Abdulaziz Alkandari, Nenad Mladenovic:
Packing unit spheres into the smallest sphere using VNS and NLP. Comput. Oper. Res. 40(2): 603-615 (2013) - [j71]Sergio Consoli, José Andrés Moreno-Pérez, Nenad Mladenovic:
Intelligent variable neighbourhood search for the minimum labelling spanning tree problem. Electron. Notes Discret. Math. 41: 399-406 (2013) - [j70]Samira Almoustafa, Saïd Hanafi, Nenad Mladenovic:
New exact method for large asymmetric distance-constrained vehicle routing problem. Eur. J. Oper. Res. 226(3): 386-394 (2013) - [j69]Emilio Carrizosa, Nenad Mladenovic, Raca Todosijevic:
Variable neighborhood search for minimum sum-of-squares clustering on networks. Eur. J. Oper. Res. 230(2): 356-363 (2013) - [c5]Sergio Consoli, José Andrés Moreno-Pérez, Nenad Mladenovic:
Intelligent Optimization for the Minimum Labelling Spanning Tree Problem. LION 2013: 19-23 - 2012
- [j68]Emilio Carrizosa, Milan Drazic, Zorica Drazic, Nenad Mladenovic:
Gaussian variable neighborhood search for continuous optimization. Comput. Oper. Res. 39(9): 2206-2213 (2012) - [j67]Abraham Duarte, Laureano F. Escudero, Rafael Martí, Nenad Mladenovic, Juan José Pantrigo, Jesús Sánchez-Oro:
Variable neighborhood search for the Vertex Separation Problem. Comput. Oper. Res. 39(12): 3247-3255 (2012) - [j66]Angelo Sifaleras, Dragan Urosevic, Nenad Mladenovic:
EURO Mini Conference (MEC XXVIII) on Variable Neighborhood Search. Electron. Notes Discret. Math. 39: 1-4 (2012) - [j65]Nenad Mladenovic, Jozef Kratica, Vera Kovacevic-Vujcic, Mirjana Cangalovic:
Variable neighborhood search for the strong metric dimension problem. Electron. Notes Discret. Math. 39: 51-57 (2012) - [j64]Eduardo G. Pardo, Nenad Mladenovic, Juan José Pantrigo, Abraham Duarte:
A Variable Neighbourhood Search approach to the Cutwidth Minimization Problem. Electron. Notes Discret. Math. 39: 67-74 (2012) - [j63]Nenad Mladenovic, Raca Todosijevic, Dragan Urosevic:
An efficient GVNS for solving Traveling Salesman Problem with Time Windows. Electron. Notes Discret. Math. 39: 83-90 (2012) - [j62]Antonio Alonso-Ayuso, Laureano F. Escudero, Francisco Javier Martín-Campo, Nenad Mladenovic:
VNS based algorithm for solving a 0-1 nonlinear nonconvex model for the Collision Avoidance in Air Traffic Management. Electron. Notes Discret. Math. 39: 115-120 (2012) - [j61]Sanja Roksandic, Emilio Carrizosa, Dragan Urosevic, Nenad Mladenovic:
Solving Multifacility Huff Location Models on Networks Using Variable Neighborhood Search and Multi-Start Local Search Metaheuristics. Electron. Notes Discret. Math. 39: 121-128 (2012) - [j60]Jack Brimberg, Zvi Drezner, Nenad Mladenovic, Saïd Salhi:
Generating good starting solutions for the p-median problem in the plane. Electron. Notes Discret. Math. 39: 225-232 (2012) - [j59]Nenad Mladenovic, Dragan Urosevic, Saïd Hanafi, Aleksandar Ilic:
A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem. Eur. J. Oper. Res. 220(1): 270-285 (2012) - [j58]Nenad Mladenovic, Jozef Kratica, Vera Kovacevic-Vujcic, Mirjana Cangalovic:
Variable neighborhood search for metric dimension and minimal doubly resolving set problems. Eur. J. Oper. Res. 220(2): 328-337 (2012) - 2011
- [j57]Steven D. Noble, Pierre Hansen, Nenad Mladenovic:
Maximizing edge-ratio is NP-complete. Discret. Appl. Math. 159(18): 2276-2280 (2011) - [j56]Vladica Tintor, Dragan Urosevic, Bojana Andjelic, Jovan Radunovic, Nenad Mladenovic:
Variable neighbourhood search for resolving routing and wavelength assignment problem in optical wavelength-division multiplexing networks. IET Commun. 5(14): 2028-2034 (2011) - [j55]Leo Liberti, Nenad Mladenovic, Giacomo Nannicini:
A recipe for finding good solutions to MINLPs. Math. Program. Comput. 3(4): 349-390 (2011) - 2010
- [j54]Jack Brimberg, Pierre Hansen, Nenad Mladenovic:
Attraction probabilities in variable neighborhood search. 4OR 8(2): 181-194 (2010) - [j53]Qiu-Hong Zhao, Jack Brimberg, Nenad Mladenovic:
A variable neighborhood search based algorithm for finite-horizon Markov Decision Processes. Appl. Math. Comput. 217(7): 3480-3492 (2010) - [j52]Pierre Hansen, Nenad Mladenovic, José A. Moreno-Pérez:
Variable neighbourhood search: methods and applications. Ann. Oper. Res. 175(1): 367-407 (2010) - [j51]Jasmina Lazic, Saïd Hanafi, Nenad Mladenovic, Dragan Urosevic:
Variable neighbourhood decomposition search for 0-1 mixed integer programs. Comput. Oper. Res. 37(6): 1055-1067 (2010) - [j50]Saïd Hanafi, Jasmina Lazic, Nenad Mladenovic:
Variable Neighbourhood Pump Heuristic for 0-1 Mixed Integer Programming Feasibility. Electron. Notes Discret. Math. 36: 759-766 (2010) - [j49]Saïd Hanafi, Jasmina Lazic, Nenad Mladenovic, Christophe Wilbaut, Igor Crévits:
Hybrid Variable Neighbourhood Decomposition Search for 0-1 Mixed Integer Programming Problem. Electron. Notes Discret. Math. 36: 883-890 (2010) - [j48]Nenad Mladenovic, Dragan Urosevic, Dionisio Pérez-Brito, Carlos G. García-González:
Variable neighbourhood search for bandwidth reduction. Eur. J. Oper. Res. 200(1): 14-27 (2010) - [j47]Sylvain Perron, Pierre Hansen, Sébastien Le Digabel, Nenad Mladenovic:
Exact and heuristic solutions of the global supply chain problem with transfer pricing. Eur. J. Oper. Res. 202(3): 864-879 (2010) - [j46]Aleksandar Ilic, Dragan Urosevic, Jack Brimberg, Nenad Mladenovic:
A general variable neighborhood search for solving the uncapacitated single allocation p-hub median problem. Eur. J. Oper. Res. 206(2): 289-300 (2010) - [j45]Sergio Consoli, José Andrés Moreno-Pérez, Kenneth Darby-Dowman, Nenad Mladenovic:
Discrete Particle Swarm Optimization for the minimum labelling Steiner tree problem. Nat. Comput. 9(1): 29-46 (2010) - [c4]Saïd Hanafi, Jasmina Lazic, Nenad Mladenovic, Christophe Wilbaut, Igor Crévits:
New Hybrid Matheuristics for Solving the Multidimensional Knapsack Problem. Hybrid Metaheuristics 2010: 118-132 - [p3]Leo Liberti, Giacomo Nannicini, Nenad Mladenovic:
A Good Recipe for Solving MINLPs. Matheuristics 2010: 231-244
2000 – 2009
- 2009
- [j44]Sergio Consoli, Ken Darby-Dowman, Nenad Mladenovic, José A. Moreno-Pérez:
Variable neighbourhood search for the minimum labelling Steiner tree problem. Ann. Oper. Res. 172(1): 71-96 (2009) - [j43]Jack Brimberg, Nenad Mladenovic, Dragan Urosevic, Eric Ngai:
Variable neighborhood search for the heaviest k-subgraph. Comput. Oper. Res. 36(11): 2885-2891 (2009) - [j42]Qiu-Hong Zhao, Dragan Urosevic, Nenad Mladenovic, Pierre Hansen:
A restarted and modified simplex search for unconstrained optimization. Comput. Oper. Res. 36(12): 3263-3271 (2009) - [j41]Pierre Hansen, Jack Brimberg, Dragan Urosevic, Nenad Mladenovic:
Solving large p-median clustering problems by primal-dual variable neighborhood search. Data Min. Knowl. Discov. 19(3): 351-375 (2009) - [j40]Sergio Consoli, Ken Darby-Dowman, Nenad Mladenovic, José A. Moreno-Pérez:
Greedy Randomized Adaptive Search and Variable Neighbourhood Search for the minimum labelling spanning tree problem. Eur. J. Oper. Res. 196(2): 440-449 (2009) - [j39]Jack Brimberg, Robert F. Love, Nenad Mladenovic:
Extension of the Weiszfeld procedure to a single facility minisum location model with mixed ℓp norms. Math. Methods Oper. Res. 70(2): 269-283 (2009) - [r1]Pierre Hansen, Nenad Mladenovic:
Variable Neighborhood Search Methods. Encyclopedia of Optimization 2009: 3975-3989 - 2008
- [j38]Pierre Hansen, Nenad Mladenovic, José A. Moreno-Pérez:
Variable neighbourhood search: methods and applications. 4OR 6(4): 319-360 (2008) - [j37]Milan Drazic, Carlile Lavor, Nelson Maculan, Nenad Mladenovic:
A continuous variable neighborhood search heuristic for finding the three-dimensional structure of a molecule. Eur. J. Oper. Res. 185(3): 1265-1273 (2008) - [j36]Pierre Hansen, Nenad Mladenovic, José A. Moreno-Pérez:
Variable neighborhood search. Eur. J. Oper. Res. 191(3): 593-595 (2008) - [j35]Pierre Hansen, Ceyda Oguz, Nenad Mladenovic:
Variable neighborhood search for minimum cost berth allocation. Eur. J. Oper. Res. 191(3): 636-649 (2008) - [j34]Nenad Mladenovic, Milan Drazic, Vera Kovacevic-Vujcic, Mirjana Cangalovic:
General variable neighborhood search for the continuous optimization. Eur. J. Oper. Res. 191(3): 753-770 (2008) - [j33]Jack Brimberg, Nenad Mladenovic, Dragan Urosevic:
Local and variable neighborhood search for the k -cardinality subgraph problem. J. Heuristics 14(5): 501-517 (2008) - [j32]Jack Brimberg, Pierre Hansen, Gilbert Laporte, Nenad Mladenovic, Dragan Urosevic:
The maximum return-on-investment plant location problem with market share. J. Oper. Res. Soc. 59(3): 399-406 (2008) - [j31]Pierre Hansen, Nenad Mladenovic:
Complement to a comparative analysis of heuristics for the p -median problem. Stat. Comput. 18(1): 41-46 (2008) - 2007
- [j30]Nenad Mladenovic, Jack Brimberg, Pierre Hansen, José A. Moreno-Pérez:
The p-median problem: A survey of metaheuristic approaches. Eur. J. Oper. Res. 179(3): 927-939 (2007) - [j29]Pierre Hansen, Jack Brimberg, Dragan Urosevic, Nenad Mladenovic:
Primal-Dual Variable Neighborhood Search for the Simple Plant-Location Problem. INFORMS J. Comput. 19(4): 552-564 (2007) - [c3]Nenad Mladenovic, Frank Plastria, Dragan Urosevic:
Formulation Space Search for Circle Packing Problems. SLS 2007: 212-216 - [p2]Dejan Jovanovic, Nenad Mladenovic, Zoran Ognjanovic:
Variable Neighborhood Search for the Probabilistic Satisfiability Problem. Metaheuristics 2007: 173-188 - [p1]Sergio Consoli, José A. Moreno-Pérez, Ken Darby-Dowman, Nenad Mladenovic:
Discrete Particle Swarm Optimization for the Minimum Labelling Steiner Tree Problem. NICSO 2007: 313-322 - 2006
- [j28]Pierre Hansen, Nenad Mladenovic, Dragan Urosevic:
Variable neighborhood search and local branching. Comput. Oper. Res. 33(10): 3034-3045 (2006) - [j27]Pierre Hansen, Nenad Mladenovic:
First vs. best improvement: An empirical study. Discret. Appl. Math. 154(5): 802-817 (2006) - [j26]Jack Brimberg, Dragan Urosevic, Nenad Mladenovic:
Variable neighborhood search for the vertex weighted k. Eur. J. Oper. Res. 171(1): 74-84 (2006) - [j25]Nenad Mladenovic, Jack Brimberg, Pierre Hansen:
A note on duality gap in the simple plant location problem. Eur. J. Oper. Res. 174(1): 11-22 (2006) - 2005
- [j24]Patricia Domínguez-Marín, Stefan Nickel, Pierre Hansen, Nenad Mladenovic:
Heuristic Procedures for Solving the Discrete Ordered Median Problem. Ann. Oper. Res. 136(1): 145-173 (2005) - [j23]Tatjana Davidovic, Pierre Hansen, Nenad Mladenovic:
Permutation-Based Genetic, Tabu, and Variable Neighborhood Search Heuristics for Multiprocessor Scheduling with Communication delays. Asia Pac. J. Oper. Res. 22(3): 297-326 (2005) - [j22]Pierre Hansen, Eric Ngai, Bernard K.-S. Cheung, Nenad Mladenovic:
Analysis of Global k-Means, an Incremental Heuristic for Minimum Sum-of-Squares Clustering. J. Classif. 22(2): 287-310 (2005) - [j21]Nenad Mladenovic, Frank Plastria, Dragan Urosevic:
Reformulation descent applied to circle packing problems. Comput. Oper. Res. 32: 2419-2434 (2005) - [j20]Jacques Desrosiers, Nenad Mladenovic, Daniel Villeneuve:
Design of balanced MBA student teams. J. Oper. Res. Soc. 56(1): 60-66 (2005) - [c2]Zoran Ognjanovic, Uros Midic, Nenad Mladenovic:
A Hybrid Genetic and Variable Neighborhood Descent for Probabilistic SAT Problem. Hybrid Metaheuristics 2005: 42-53 - 2004
- [j19]Dragan Urosevic, Jack Brimberg, Nenad Mladenovic:
Variable neighborhood decomposition search for the edge weighted k-cardinality tree problem. Comput. Oper. Res. 31(8): 1205-1213 (2004) - [j18]Pierre Hansen, Nenad Mladenovic, Dragan Urosevic:
Variable neighborhood search for the maximum clique. Discret. Appl. Math. 145(1): 117-125 (2004) - [j17]Teodor Gabriel Crainic, Michel Gendreau, Pierre Hansen, Nenad Mladenovic:
Cooperative Parallel Variable Neighborhood Search for the p-Median. J. Heuristics 10(3): 293-314 (2004) - [j16]Jack Brimberg, Nenad Mladenovic, Saïd Salhi:
The multi-source Weber problem with constant opening cost. J. Oper. Res. Soc. 55(6): 640-646 (2004) - [j15]Charles Audet, Jack Brimberg, Pierre Hansen, Sébastien Le Digabel, Nenad Mladenovic:
Pooling Problem: Alternate Formulations and Solution Methods. Manag. Sci. 50(6): 761-776 (2004) - 2003
- [j14]Pierre Hansen, Nenad Mladenovic, José A. Moreno-Pérez:
Búsqueda de Entorno Variable. Inteligencia Artif. 7(19): 77-92 (2003) - [j13]Nenad Mladenovic, J. Petrovic, Vera Kovacevic-Vujcic, Mirjana Cangalovic:
Solving spread spectrum radar polyphase code design problem by tabu search and variable neighbourhood search. Eur. J. Oper. Res. 151(2): 389-399 (2003) - [j12]Jack Brimberg, Pierre Hansen, Keh-Wei Lin, Nenad Mladenovic, Michèle Breton:
An Oil Pipeline Design Problem. Oper. Res. 51(2): 228-239 (2003) - [j11]Nenad Mladenovic, Martine Labbé, Pierre Hansen:
Solving the p-Center problem with Tabu Search and Variable Neighborhood Search. Networks 42(1): 48-64 (2003) - 2002
- [j10]Jack Brimberg, Pierre Hansen, Nenad Mladenovic:
A note on reduction of quadratic and bilinear programs with equality constraints. J. Glob. Optim. 22(1-4): 39-47 (2002) - [j9]Nabil Belacel, Pierre Hansen, Nenad Mladenovic:
Fuzzy J-Means: a new heuristic for fuzzy clustering. Pattern Recognit. 35(10): 2193-2200 (2002) - 2001
- [j8]Pierre Hansen, Nenad Mladenovic:
Variable neighborhood search: Principles and applications. Eur. J. Oper. Res. 130(3): 449-467 (2001) - [j7]Pierre Hansen, Nenad Mladenovic, Dionisio Pérez-Brito:
Variable Neighborhood Decomposition Search. J. Heuristics 7(4): 335-350 (2001) - [j6]Pierre Hansen, Nenad Mladenovic:
J-MEANS: a new local search heuristic for minimum sum of squares clustering. Pattern Recognit. 34(2): 405-413 (2001) - 2000
- [j5]Jack Brimberg, Pierre Hansen, Nenad Mladenovic, Éric D. Taillard:
Improvement and Comparison of Heuristics for Solving the Uncapacitated Multisource Weber Problem. Oper. Res. 48(3): 444-460 (2000)
1990 – 1999
- 1999
- [j4]Jack Brimberg, Nenad Mladenovic:
Degeneracy in the multi-source Weber problem. Math. Program. 85(1): 213-220 (1999) - [j3]Olivier du Merle, Pierre Hansen, Brigitte Jaumard, Nenad Mladenovic:
An Interior Point Algorithm for Minimum Sum-of-Squares Clustering. SIAM J. Sci. Comput. 21(4): 1485-1505 (1999) - 1998
- [j2]Pierre Hansen, Nenad Mladenovic, Éric D. Taillard:
Heuristic solution of the multisource Weber problem as a p-median problem. Oper. Res. Lett. 22(2-3): 55-62 (1998) - 1997
- [j1]Nenad Mladenovic, Pierre Hansen:
Variable neighborhood search. Comput. Oper. Res. 24(11): 1097-1100 (1997) - 1993
- [c1]Pierre Hansen, Brigitte Jaumard, Nenad Mladenovic:
How to Choose K Entities Among N. Partitioning Data Sets 1993: 105-116
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:12 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
