The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Nenad Mladenovic: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Zoran Ognjanovic, Uros Midic, Nenad Mladenovic
    A Hybrid Genetic and Variable Neighborhood Descent for Probabilistic SAT Problem. [Citation Graph (0, 0)][DBLP]
    Hybrid Metaheuristics, 2005, pp:42-53 [Conf]
  2. Pierre Hansen, Nenad Mladenovic, José A. Moreno-Pérez
    Búsqueda de Entorno Variable. [Citation Graph (0, 0)][DBLP]
    Inteligencia Artificial, Revista Iberoamericana de Inteligencia Artificial, 2003, v:19, n:, pp:77-92 [Journal]
  3. Nenad Mladenovic, Pierre Hansen
    Variable neighborhood search. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 1997, v:24, n:11, pp:1097-1100 [Journal]
  4. Nenad Mladenovic, Frank Plastria, Dragan Urosevic
    Reformulation descent applied to circle packing problems. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:2419-2434 [Journal]
  5. Dragan Urosevic, Jack Brimberg, Nenad Mladenovic
    Variable neighborhood decomposition search for the edge weighted k-cardinality tree problem. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2004, v:31, n:8, pp:1205-1213 [Journal]
  6. Pierre Hansen, Nenad Mladenovic, Dragan Urosevic
    Variable neighborhood search and local branching. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2006, v:33, n:10, pp:3034-3045 [Journal]
  7. Pierre Hansen, Nenad Mladenovic
    First vs. best improvement: An empirical study. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2006, v:154, n:5, pp:802-817 [Journal]
  8. Pierre Hansen, Nenad Mladenovic, Dragan Urosevic
    Variable neighborhood search for the maximum clique. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:145, n:1, pp:117-125 [Journal]
  9. Pierre Hansen, Nenad Mladenovic, Dionisio Perez-Britos
    Variable Neighborhood Decomposition Search. [Citation Graph (0, 0)][DBLP]
    J. Heuristics, 2001, v:7, n:4, pp:335-350 [Journal]
  10. Teodor Gabriel Crainic, Michel Gendreau, Pierre Hansen, Nenad Mladenovic
    Cooperative Parallel Variable Neighborhood Search for the p-Median. [Citation Graph (0, 0)][DBLP]
    J. Heuristics, 2004, v:10, n:3, pp:293-314 [Journal]
  11. Nenad Mladenovic, Martine Labbé, Pierre Hansen
    Solving the p-Center problem with Tabu Search and Variable Neighborhood Search. [Citation Graph (0, 0)][DBLP]
    Networks, 2003, v:42, n:1, pp:48-64 [Journal]
  12. Pierre Hansen, Nenad Mladenovic, Éric D. Taillard
    Heuristic solution of the multisource Weber problem as a p-median problem. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 1998, v:22, n:2-3, pp:55-62 [Journal]
  13. Nabil Belacel, Pierre Hansen, Nenad Mladenovic
    Fuzzy J-Means: a new heuristic for fuzzy clustering. [Citation Graph (0, 0)][DBLP]
    Pattern Recognition, 2002, v:35, n:10, pp:2193-2200 [Journal]
  14. Pierre Hansen, Nenad Mladenovic
    J-MEANS: a new local search heuristic for minimum sum of squares clustering. [Citation Graph (0, 0)][DBLP]
    Pattern Recognition, 2001, v:34, n:2, pp:405-413 [Journal]
  15. Jack Brimberg, Dragan Urosevic, Nenad Mladenovic
    Variable neighborhood search for the vertex weighted k. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2006, v:171, n:1, pp:74-84 [Journal]
  16. Nenad Mladenovic, Jack Brimberg, Pierre Hansen
    A note on duality gap in the simple plant location problem. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2006, v:174, n:1, pp:11-22 [Journal]
  17. Nenad Mladenovic, Jack Brimberg, Pierre Hansen, José A. Moreno-Pérez
    The p. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2007, v:179, n:3, pp:927-939 [Journal]
  18. Nenad Mladenovic, J. Petrovic, Vera Kovacevic-Vujcic, Mirjana Cangalovic
    Solving spread spectrum radar polyphase code design problem by tabu search and variable neighbourhood search. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2003, v:151, n:2, pp:389-399 [Journal]
  19. Nenad Mladenovic, Frank Plastria, Dragan Urosevic
    Formulation Space Search for Circle Packing Problems. [Citation Graph (0, 0)][DBLP]
    SLS, 2007, pp:212-216 [Conf]

  20. Variable neighbourhood search: methods and applications. [Citation Graph (, )][DBLP]


  21. Variable neighborhood search for the heaviest k-subgraph. [Citation Graph (, )][DBLP]


  22. A restarted and modified simplex search for unconstrained optimization. [Citation Graph (, )][DBLP]


  23. Variable neighbourhood decomposition search for 0-1 mixed integer programs. [Citation Graph (, )][DBLP]


  24. Solving large p-median clustering problems by primal-dual variable neighborhood search. [Citation Graph (, )][DBLP]


Search in 0.031secs, Finished in 0.032secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002