Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Nenad Mladenovic
2010 – today
- 2013
[j65]Nenad Mladenovic, Dragan Urosevic, Saïd Hanafi: Variable neighborhood search for the travelling deliveryman problem. 4OR 11(1): 57-73 (2013)- [j64]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)
- [j63]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)
- [j62]Bassem Jarboui, Houda Derbel, Saïd Hanafi, Nenad Mladenovic: Variable neighborhood search for location routing. Computers & OR 40(1): 47-57 (2013)
- [j61]Rym M'Hallah, Abdulaziz Alkandari, Nenad Mladenovic: Packing unit spheres into the smallest sphere using VNS and NLP. Computers & OR 40(2): 603-615 (2013)
- [j60]Samira Almoustafa, Saïd Hanafi, Nenad Mladenovic: New exact method for large asymmetric distance-constrained vehicle routing problem. European Journal of Operational Research 226(3): 386-394 (2013)
- 2012
- [j59]Emilio Carrizosa, Milan Drazic, Zorica Drazic, Nenad Mladenovic: Gaussian variable neighborhood search for continuous optimization. Computers & OR 39(9): 2206-2213 (2012)
- [j58]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. Computers & OR 39(12): 3247-3255 (2012)
- [j57]Angelo Sifaleras, Dragan Urosevic, Nenad Mladenovic: EURO Mini Conference (MEC XXVIII) on Variable Neighborhood Search. Electronic Notes in Discrete Mathematics 39: 1-4 (2012)
- [j56]Nenad Mladenovic, Jozef Kratica, Vera Kovacevic-Vujcic, Mirjana Cangalovic: Variable neighborhood search for the strong metric dimension problem. Electronic Notes in Discrete Mathematics 39: 51-57 (2012)
- [j55]Eduardo G. Pardo, Nenad Mladenovic, Juan José Pantrigo, Abraham Duarte: A Variable Neighbourhood Search approach to the Cutwidth Minimization Problem. Electronic Notes in Discrete Mathematics 39: 67-74 (2012)
- [j54]Nenad Mladenovic, Raca Todosijevic, Dragan Urosevic: An efficient GVNS for solving Traveling Salesman Problem with Time Windows. Electronic Notes in Discrete Mathematics 39: 83-90 (2012)
- [j53]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. Electronic Notes in Discrete Mathematics 39: 115-120 (2012)
- [j52]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. Electronic Notes in Discrete Mathematics 39: 121-128 (2012)
- [j51]Jack Brimberg, Zvi Drezner, Nenad Mladenovic, Said Salhi: Generating good starting solutions for the p-median problem in the plane. Electronic Notes in Discrete Mathematics 39: 225-232 (2012)
- [j50]Nenad Mladenovic, Dragan Urosevic, Saïd Hanafi, Aleksandar Ilic: A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem. European Journal of Operational Research 220(1): 270-285 (2012)
- [j49]Nenad Mladenovic, Jozef Kratica, Vera Kovacevic-Vujcic, Mirjana Cangalovic: Variable neighborhood search for metric dimension and minimal doubly resolving set problems. European Journal of Operational Research 220(2): 328-337 (2012)
- [i1]Sergio Consoli, Nenad Mladenovic, José Andrés Moreno-Pérez: Solving the minimum labelling spanning tree problem using intelligent optimization. CoRR abs/1201.2320 (2012)
- 2011
- [j48]Steven D. Noble, Pierre Hansen, Nenad Mladenovic: Maximizing edge-ratio is NP-complete. Discrete Applied Mathematics 159(18): 2276-2280 (2011)
- [j47]Leo Liberti, Nenad Mladenovic, Giacomo Nannicini: A recipe for finding good solutions to MINLPs. Math. Program. Comput. 3(4): 349-390 (2011)
- 2010
- [j46]Jack Brimberg, Pierre Hansen, Nenad Mladenovic: Attraction probabilities in variable neighborhood search. 4OR 8(2): 181-194 (2010)
- [j45]Qiu Hong Zhao, Jack Brimberg, Nenad Mladenovic: A variable neighborhood search based algorithm for finite-horizon Markov Decision Processes. Applied Mathematics and Computation 217(7): 3480-3492 (2010)
- [j44]Pierre Hansen, Nenad Mladenovic, José A. Moreno-Pérez: Variable neighbourhood search: methods and applications. Annals OR 175(1): 367-407 (2010)
- [j43]Jasmina Lazic, Saïd Hanafi, Nenad Mladenovic, Dragan Urosevic: Variable neighbourhood decomposition search for 0-1 mixed integer programs. Computers & OR 37(6): 1055-1067 (2010)
- [j42]Saïd Hanafi, Jasmina Lazic, Nenad Mladenovic: Variable Neighbourhood Pump Heuristic for 0-1 Mixed Integer Programming Feasibility. Electronic Notes in Discrete Mathematics 36: 759-766 (2010)
- [j41]Saïd Hanafi, Jasmina Lazic, Nenad Mladenovic, Christophe Wilbaut, Igor Crévits: Hybrid Variable Neighbourhood Decomposition Search for 0-1 Mixed Integer Programming Problem. Electronic Notes in Discrete Mathematics 36: 883-890 (2010)
- [j40]Nenad Mladenovic, Dragan Urosevic, Dionisio Pérez-Brito, Carlos G. García-González: Variable neighbourhood search for bandwidth reduction. European Journal of Operational Research 200(1): 14-27 (2010)
- [j39]Sylvain Perron, Pierre Hansen, Sébastien Le Digabel, Nenad Mladenovic: Exact and heuristic solutions of the global supply chain problem with transfer pricing. European Journal of Operational Research 202(3): 864-879 (2010)
- [j38]Aleksandar Ilic, Dragan Urosevic, Jack Brimberg, Nenad Mladenovic: A general variable neighborhood search for solving the uncapacitated single allocation p-hub median problem. European Journal of Operational Research 206(2): 289-300 (2010)
- [j37]Sergio Consoli, José Andrés Moreno-Pérez, Kenneth Darby-Dowman, Nenad Mladenovic: Discrete Particle Swarm Optimization for the minimum labelling Steiner tree problem. Natural Computing 9(1): 29-46 (2010)
- [c3]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
- [p2]Leo Liberti, Giacomo Nannicini, Nenad Mladenovic: A Good Recipe for Solving MINLPs. Matheuristics 2010: 231-244
2000 – 2009
- 2009
- [j36]Sergio Consoli, Ken Darby-Dowman, Nenad Mladenovic, José A. Moreno-Pérez: Variable neighbourhood search for the minimum labelling Steiner tree problem. Annals OR 172(1): 71-96 (2009)
- [j35]Jack Brimberg, Nenad Mladenovic, Dragan Urosevic, Eric Ngai: Variable neighborhood search for the heaviest k-subgraph. Computers & OR 36(11): 2885-2891 (2009)
- [j34]Qiu Hong Zhao, Dragan Urosevic, Nenad Mladenovic, Pierre Hansen: A restarted and modified simplex search for unconstrained optimization. Computers & OR 36(12): 3263-3271 (2009)
- [j33]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)
- [j32]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. European Journal of Operational Research 196(2): 440-449 (2009)
- [j31]Jack Brimberg, Robert Love, Nenad Mladenovic: Extension of the Weiszfeld procedure to a single facility minisum location model with mixed ℓp norms. Math. Meth. of OR 70(2): 269-283 (2009)
- [r1]Pierre Hansen, Nenad Mladenovic: Variable Neighborhood Search Methods. Encyclopedia of Optimization 2009: 3975-3989
- 2008
- [j30]Pierre Hansen, Nenad Mladenovic, José A. Moreno-Pérez: Variable neighbourhood search: methods and applications. 4OR 6(4): 319-360 (2008)
- [j29]Milan Drazic, Carlile Lavor, Nelson Maculan, Nenad Mladenovic: A continuous variable neighborhood search heuristic for finding the three-dimensional structure of a molecule. European Journal of Operational Research 185(3): 1265-1273 (2008)
- [j28]Pierre Hansen, Nenad Mladenovic, José A. Moreno-Pérez: Variable neighborhood search. European Journal of Operational Research 191(3): 593-595 (2008)
- [j27]Pierre Hansen, Ceyda Oguz, Nenad Mladenovic: Variable neighborhood search for minimum cost berth allocation. European Journal of Operational Research 191(3): 636-649 (2008)
- [j26]Nenad Mladenovic, Milan Drazic, Vera Kovacevic-Vujcic, Mirjana Cangalovic: General variable neighborhood search for the continuous optimization. European Journal of Operational Research 191(3): 753-770 (2008)
- [j25]Jack Brimberg, Nenad Mladenovic, Dragan Urosevic: Local and variable neighborhood search for the k -cardinality subgraph problem. J. Heuristics 14(5): 501-517 (2008)
- [j24]Pierre Hansen, Nenad Mladenovic: Complement to a comparative analysis of heuristics for the p -median problem. Statistics and Computing 18(1): 41-46 (2008)
- 2007
- [j23]Nenad Mladenovic, Jack Brimberg, Pierre Hansen, José A. Moreno-Pérez: The p. European Journal of Operational Research 179(3): 927-939 (2007)
- [j22]Pierre Hansen, Jack Brimberg, Dragan Urosevic, Nenad Mladenovic: Primal-Dual Variable Neighborhood Search for the Simple Plant-Location Problem. INFORMS Journal on Computing 19(4): 552-564 (2007)
- [c2]Nenad Mladenovic, Frank Plastria, Dragan Urosevic: Formulation Space Search for Circle Packing Problems. SLS 2007: 212-216
- [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
- [j21]Pierre Hansen, Nenad Mladenovic, Dragan Urosevic: Variable neighborhood search and local branching. Computers & OR 33(10): 3034-3045 (2006)
- [j20]Pierre Hansen, Nenad Mladenovic: First vs. best improvement: An empirical study. Discrete Applied Mathematics 154(5): 802-817 (2006)
- [j19]Jack Brimberg, Dragan Urosevic, Nenad Mladenovic: Variable neighborhood search for the vertex weighted k. European Journal of Operational Research 171(1): 74-84 (2006)
- [j18]Nenad Mladenovic, Jack Brimberg, Pierre Hansen: A note on duality gap in the simple plant location problem. European Journal of Operational Research 174(1): 11-22 (2006)
- 2005
- [j17]Patricia Domínguez-Marín, Stefan Nickel, Pierre Hansen, Nenad Mladenovic: Heuristic Procedures for Solving the Discrete Ordered Median Problem. Annals OR 136(1): 145-173 (2005)
- [j16]Pierre Hansen, Eric Ngai, Bernard K. Cheung, Nenad Mladenovic: Analysis of Global k-Means, an Incremental Heuristic for Minimum Sum-of-Squares Clustering. J. Classification 22(2): 287-310 (2005)
- [j15]Nenad Mladenovic, Frank Plastria, Dragan Urosevic: Reformulation descent applied to circle packing problems. Computers & OR 32: 2419-2434 (2005)
- [c1]Zoran Ognjanovic, Uros Midic, Nenad Mladenovic: A Hybrid Genetic and Variable Neighborhood Descent for Probabilistic SAT Problem. Hybrid Metaheuristics 2005: 42-53
- 2004
- [j14]Dragan Urosevic, Jack Brimberg, Nenad Mladenovic: Variable neighborhood decomposition search for the edge weighted k-cardinality tree problem. Computers & OR 31(8): 1205-1213 (2004)
- [j13]Pierre Hansen, Nenad Mladenovic, Dragan Urosevic: Variable neighborhood search for the maximum clique. Discrete Applied Mathematics 145(1): 117-125 (2004)
- [j12]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)
- [j11]Charles Audet, Jack Brimberg, Pierre Hansen, Sébastien Le Digabel, Nenad Mladenovic: Pooling Problem: Alternate Formulations and Solution Methods. Management Science 50(6): 761-776 (2004)
- 2003
- [j10]Pierre Hansen, Nenad Mladenovic, José A. Moreno-Pérez: Búsqueda de Entorno Variable. Inteligencia Artificial, Revista Iberoamericana de Inteligencia Artificial 7(19): 77-92 (2003)
- [j9]Nenad Mladenovic, J. Petrovic, Vera Kovacevic-Vujcic, Mirjana Cangalovic: Solving spread spectrum radar polyphase code design problem by tabu search and variable neighbourhood search. European Journal of Operational Research 151(2): 389-399 (2003)
- [j8]Jack Brimberg, Pierre Hansen, Keh-Wei Lin, Nenad Mladenovic, Michèle Breton: An Oil Pipeline Design Problem. Operations Research 51(2): 228-239 (2003)
- [j7]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
- [j6]Nabil Belacel, Pierre Hansen, Nenad Mladenovic: Fuzzy J-Means: a new heuristic for fuzzy clustering. Pattern Recognition 35(10): 2193-2200 (2002)
- 2001
- [j5]Pierre Hansen, Nenad Mladenovic: Variable neighborhood search: Principles and applications. European Journal of Operational Research 130(3): 449-467 (2001)
- [j4]Pierre Hansen, Nenad Mladenovic, Dionisio Pérez-Brito: Variable Neighborhood Decomposition Search. J. Heuristics 7(4): 335-350 (2001)
- [j3]Pierre Hansen, Nenad Mladenovic: J-MEANS: a new local search heuristic for minimum sum of squares clustering. Pattern Recognition 34(2): 405-413 (2001)
1990 – 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. Computers & OR 24(11): 1097-1100 (1997)
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-04 22:19 CEST by the dblp team