Brunel University
School of Mathematics
West London, Uxbridge
Middlesex, UB8 3PH
United Kingdom

Tel.: (018) 952-66151

nenad.mladenovic@brunel.ac.uk

 

# of citations, November 2011 (WoS)
1661
h research index
18
g research index
38

 

Publications
Permanent Positions
Part-Time Positions
Visiting Positions
Professional Activities
Research Interest
Education

Photos


Publications

Books, chapters, journal articles

2012

  1. Consoli S, Mladenovic N and Moreno-Perez JA. Solving the minimum labelling spanning tree problem using intelligent optimization (submitted).
  2. Hansen P, Mladenovic N and Brimberg J. Sequential clustering with radius and split criteria (submitted).
  3. Duarte A, Escudero LF, Marti R, Mladenovic N, Pantrigo JJ, Sanchez-Oro J. Variable Neighborhood Search for the Vertex Separation Problem (submitted).
  4. Almoustafa S, Hanafi S and Mladenovic N. Multistart branch and bound for large asymmetric distance-constrained vehicle routing problem (submitted).
  5. M'Hallah R, Alkandari A, Mladenovic N. Packing unit spheres into the smallest sphere using VNS and NLP (submitted).
  6. Nikolic N, Grujicic I, Mladenovic N. New Greedy and Reduction Algorithms for Covering Designs (submitted).
  7. Davidovic T, Lazic J, Maras V and Mladenovic N. Routing of barge container ships using MIP heuristics (submitted).
  8. Sheikh-Rajab R, Drazic M, Mladenovic N and Yu K. Fitting censored quantile regression by variable neighbourhood search (submitted).
  9. Lazic J, Mitra G, Mladenovic N and Zverovich V. Variable neighborhood decomposition search for the two-stage stochastic Mixed integer programming problem (submitted).
  10. Mladenovic N, Kratica J, Kovacevic-Vujcic V, Cangalovic M. Metric dimension and related problems (in revision).
  11. Carrizosa E, Al-Guwaizani A, Hansen P, Mladenovic N. Degeneracy of harmonic means clustering (in revision).
  12. Jarboui B, Derbel H, Hanafi S and Mladenovic N. Variable neighborhood search approaches for a Location routing problem (in revision).
  13. Mladenovic N, Urosevic D, Hanafi S, Ilic A. A General variable neighborhood search for the One-commodity pickup-and-delivery travelling salesman problem (in revision).
  14. Carrizosa E, Drazic M, Drazic Z, Mladenovic N. Gaussian Variable Neighborhood Search for Continuous Optimization. Computers and Operations Research 39 (2012) 2206-2213.
  15. Zhao Q, Mladenovic N, and Urosevic D. A Parametric Simplex Search for Unconstrained Optimization Problem, Transactions on Advanced Research 8 (2012) 22-27.

    2011

  16. Carrizosa E, Mladenovic N, Todosijevic R. Sum-of-squares clustering on networks, Yugoslav Journal of Operations research 21 (2011) 157-161.
  17. Noble S, Hansen P and Mladenovic N. Maximizing edge-ratio is NP-hard. Discrete Applied Mathematics 159 (2011) 2276-2280.
  18. Liberti L, Mladenovic N and Nannicini G. A recipe for solving Mixed integer nonlinear programming problems, Mathematical Programming Computation 3 (2011) 349-390.
  19. Tintor V, Urosevic D, Andjelic B, Radulovic J, Mladenovic N, Variable neighbourhood search for resolving RWA problem in optical WDM networks, IET Communications 5 (2011) 2028-2034.
  20. Alguwaizani A, Hansen P, Mladenovic N, Ngai E. Variable neighbourhood search for harmonic means clustering, Applied Mathematical Modelling 35 (2011) 2688–2694.
  21. Derbel H, Jarboui B, Chabchoub B, Hanafi S and Mladenovic N: A varible neighborhood search for the capacitated location-routing problem, LOGISTIQUA, 4th international conference on logistics, 10.1109/Logistiqua. 2011.5939452, pages: 514-519 (IEEE Conferences).

    2010

  22. Hanafi S, Lazic J, Mladenovic N , Wilbaut C and Crévits I. New Hybrid Matheuristics for Solving the Multidimensional Knapsack Problem Lecture Notes in Computer Science 6373 (2010) 118-132.
  23. Mladenovic N, Hanafi S and Lazic J. Variable neighborhood search pump and diving for MIP initialization, Plenary talk, Proceedings of Discrete Optimization and Operational Research, ISBN 978-5-86134-172-1, pp 40-43, Novosibirsk, 2010.
  24. Zhao QH, Brimberg J and Mladenovic N. A Variable neighborhood search based algorithm for finite-horizon Markov decision processes Applied Mathematics and Computation 217 (2010) 3480-3492.
  25. Hanafi S, Lazic J, Mladenovic N. Variable neighbourhood pump heuristic for 0-1 Mixed integer programming feasibility. Electronic Notes in Discrete Mathematics: 36 (2010) 759-766.
  26. Hanafi S, Lazic J, Mladenovic N, Wilbaut C and Crévits I. Hybrid variable neighbourhood decomposition search for 0-1 MIP. Electronic Notes in Discrete Mathematics: 36 (2010) 883-890.
  27. Hansen P, Mladenovic N, Brimberg J and Moreno Pérez JA. Variable neighbourhood search, Handbook of Metaheuristics, 2nd edition (Gendreau and Potvin Eds), International Series in Operations Research & Management Sciences 146, pp 61-- 86, Kluwer, 2010.
  28. Brimberg J, Hansen P and Mladenovic N. Attraction probabilities in variable neighborhood search 4OR 8 (2010) 181-194.
  29. Consoli S, Moreno-Perez JA, Darby-Dowman K, Mladenovic N. Discrete Particle Swarm Optimization for the minimum labelling Steiner tree problem Natural Computing 9 (2010) 29-46.
  30. Ilic A, Urosevic D, Brimberg J and Mladenovic N. Variable neighborhood search for solving the uncapacitated single allocation p-hub median problem. European J of Operational Research 206 (2010) 289-300.
  31. Hansen P, Mladenovic N and Moreno Pérez JA. Variable neighbourhood search: algorithms and applications Annals of Operations Research 175 (2010) 367-407.
  32. Lazic J, Hanafi S, Mladenovic N and Urosevic D. Variable neighborhood decomposition search for 0-1 Mixed integer programs. Computers and Operations Research 37 (2010) 1055-1067.
  33. Perron S, Hansen P, Le Digabel S and Mladenovic N. Transfer pricing in a global supply chain. European J of Operational Research 202 (2010) 864-879.
  34. Mladenovic N, Urosevic D, Perez-Brito D and Garcia-Gonzalez CG. Variable neighborhood search for bandwidth reduction. European J of Operational Research 200 (2010) 14-27.

    2009

  35. Hansen P, Mladenovic N. Variable neighborhood search methods, Encyclopedia of Optimization , 2nd Edition, (Floudas, Pardalos eds), (Part 22), pp 3975-3989, doi. 10.1007/978-0-387-74759-0, Springer 2009.
  36. Liberti L, Nannicini G and Mladenovic N. A good recipe for solving MINLPs. In Matheuristics: Hybridizing metaheuristics and mathematical programming (Maniezo, Stuetzle, Voss Eds). Book series Annals of Information Systems 10 (2009) 231-244, Springer Verlag, New York, 2009.
  37. Consoli S, Darby-Dowman K, Mladenovic N and Moreno J. Variable neighbourhood search for the minimum labelling Steiner tree problem Annals of Operations Research 172 (2009) 71-96.
  38. Brimberg J, Love R and Mladenovic N. Extension of the Weiszfeld procedure to a single facility minisum location model with mixed norms. Mathematical Methods of Operations Research, 70 (2009) 269-283, DOI: 10.1007/s00186-008-026-z
  39. Brimberg J, Hansen P, Mladenovic N and Urosevic D. Solving large p-median clustering problems by primal-dual variable neighborhood search Data Mining and Knowledge Discovery 19 (2009) 351-375.
  40. Zhao Q, Urosevic D, Mladenovic N, Hansen P. A restarted and modified simplex search for unconstrained optimization Computers and Operations Research 36 (2009) 3263-3271.
  41. Brimberg J, Mladenovic N, Urosevic D and Ngai E. Variable neighborhood search for the heaviest k-subgraph. Computers and Operations Research 36 (2009) 2885-2891.
  42. Consoli S, Darby-Dowman K, Mladenovic N and Moreno J. Greedy randomized adaptive search and variable neighbourhood search for the minimum labelling spanning tree problem European J of Operational Research 196 (2009) 440-449.

    2008

  43. Consoli S, Moreno J, Darby-Dowman and Mladenovic N. Discrete particle swarm optimization for the Minimum labelling Steiner tree problem. Nature Inspired Cooperative Strategies for Optimization (Book series Studies in Computational Intelligence 129) pp 313-322, Springer Berlin / Heidelberg 2008.
  44. Hansen P, Mladenovic N and JA Moreno Pérez. Variable neighbourhood search: methods and applications (invited survey) 4OR, Vol 6 (2008) 319-360.
  45. Brimberg J, Mladenovic N and Urosevic D. Variable Neighborhood Search for the k-cardinality subgraph problem, Journal of Heuristics 14 (2008) 501–517.
  46. Mladenovic N. Dražic M, Kovacevic-Vujcic V, Cangalovic M. General variable neighborhood search for the continuous optimization, European J of Operational Research 191 (2008) 753-770.
  47. Hansen P, Mladenovic N, Jose A. Moreno Pérez. Variable neighborhood search European J of Operational Research 191 (2008) 593-595.
  48. Hansen P, Oguz C and Mladenovic N. Variable neighborhood search for minimum cost berth allocation, European J of Operational Research 191 (2008) 636-649.
  49. Brimberg J, Hansen P, Laporte G, Mladenovic N and Urosevic D. The maximum return-on-investment plant location problem with market share, J of Operational Research Society 59 (2008) 399-406.
  50. Brimberg J, Hansen P, Mladenovic N and Salhi S. A survey of solution methods for the continuous location - allocation problem, International Journal of Operations Research (IJOR) 5 (2008) 1-12. ISSN 0711-2440.
  51. Hansen P and Mladenovic N. Complement to a comparative analysis of heuristics for the p-median problem, Statistics and Computing 18 (2008) 41-44.
  52. Drazic M, Lavor C, Maculan N and Mladenovic N. A continuous variable neighborhood search heuristic for the three-dimensional structure of a molecule, European J of Operational Research 185 (2008) 1265–-1273.

    53. 2007

  53. Jovanovic D, Mladenovic N and Ognjanovic Z. Variable neighborhood search for the probabilistic satisfiability problem, in Metaheuristics - Progress in Complex Systems Optimization , (K.F Doerner et al Eds), pp 173-188, Springer, 2007.
  54. Moreno Pérez JA, Mladenovic N. Búsqueda por Entornos Variables para Planificación Logística, Procedimientos Metaheuristicos en Economia y Empresa (Crespo E, Marti R, Pacheco J Eds), pp 239-263, Tiran lo Blanch, Valencia 2007.
  55. Hansen P, Brimberg J, Urosevic D and Mladenovic N. Primal-dual variable neighborhood for the simple plant location problem, INFORMS J on Computing 19 (2007) 552-564.
  56. Mladenovic N. , Plastria F. and Urosevic D. Formulation space search for circle packing problems, Lecture Notes in Computer Science 4638 (2007) 212--216.
  57. Hansen P, Lazic J and Mladenovic N. Variable neighbourhood search for colour image quantization IMA Journal of Management Mathematics 18 (2007) 207--221.
  58. Mladenovic N , Brimberg J, Hansen P and Moreno-Perez J. The p-median problem: A survey of metaheuristic approaches, European J Operational Research 179 (2007) 927 -- 939.

    59. 2006

  59. Moreno-Pérez JA, Mladenovic N, Melián Batista B, García del Amo I. Variable Neighbourhood Search, (in Alba E, Marti R Eds.) Metaheuristic Procedures for Training Neural Networks Series: Operations Research/Computer Science Interfaces Series , Vol. 36 Chapter 4, pp. 71-86, 2006.
  60. Drazic M, Kovacevic-Vujcic V, Cangalovic M and Mladenovic N. GLOB - A new VNS-based software for global optimization, in Global optimization - from theory to implementation (Liberti L and Maculan N eds), 135-154, Springer 2006.
  61. Brimberg J, Hansen P and Mladenovic N. Decomposition strategies for large scale continuous location-allocation problems, IMA Journal of Management Mathematics 17 (2006) 307-316.
  62. Mladenovic N, Brimberg J and Hansen P. A note on duality gap in the simple plant location problem. European J Oper Res 174 (2006) 11-22.
  63. Hansen P and Mladenovic N. First vs best improvement: An empirical study. Discrete Applied Mathematics 154 (2006) 802-817.
  64. Hansen P Mladenovic N and Urosevic D. Variable neighborhood search and local branching. Computers and Operations Research, 33 (2006) 3034-3045.
  65. Brimberg J, Urosevic D and Mladenovic N. Variable neighborhood search for the vertex weighted k-cardinality tree, European J. of Operational Research 171 (2006) 74--84.

    66. 2005

  66. Hansen P and Mladenovic N. Variable neighborhood search, in Search Methodologies: Introductory Tutorials in Optimization and Decision Support Techniques, (E.K.Burke and G.Kendall eds.) pp. 211-238, Springer 2005.
  67. Moreno-Perez JA, Hansen P and Mladenovic N. Parallel variable neighborhood search, in Parallel Metaheuristics: A new class of algorithms (E. Alba eds.) pp. 247-266, Wiley, 2005.
  68. Hansen P, Ngai E, Cheung B and Mladenovic N. Analysis of global k-means, an incremental heuristic for minimum sum-of-squares clustering, Journal of Classification 22 (2005) 287-310.
  69. Ognjanovic Z, Midic U and Mladenovic N. A hybrid genetic and variable neighborhood descent for probabilistic SAT problem. Lecture notes in Computer Science 3636 (2005) 42--53.
  70. Davidovic T, Hansen P, Mladenovic N., Permutation based genetic, tabu and variable neighborhood search heuristics for multiprocessor scheduling with communication delays,  Asian Pacific Journal of Operations Research , 22 (2005) 297--326.
  71. Dominques-Marin P, Nickel S, Hansen P and Mladenovic N , Heuristic procedures for solving the discrete ordered median problem, Annals of Operations Research 136 (2005) 145-173.
  72. Mladenovic N, Plastria F and Urosevic D. Reformulation descent applied to circle packing problems. Computers and Oper. Res. 32 (2005) 2419-2434.
  73. Desrosiers J, Mladenovic N and Villeneuve D. Design of balanced MBA student teams, Journal of Operational Research Society 56 (2005) 60-66

    74. 2004

  74. Mladenovi N Continuous Location, Mathematical Institute, SANU, Belgrade, Serbia, 2004. (in Serbian)
  75. Mladenovic N and Urosevic D. Variable neighborhood search for the k-cardinality tree, in Metaheuristics computer decision-making,(M. Resende and J. de Sousa eds.), pp. 481-500, Kluwer Academic Publisher, 2004.
  76. Hansen P, Mladenovic N and Urosevic D. Variable neighborhood search for the Maximum clique problem, Discrete Applied Math. 145 (2004) 117-125.
  77. Audet C, Brimberg J, Hansen P, Le Digabel S and Mladenovic N. Pooling problem: Alternate Formulations and Solution Methods, Management science, 50 (2004) 761--776.
  78. Brimberg J, Mladenovic N and Salhi S. The multi-source Weber problem with constant fixed cost, J. of Oper. Res. Society. 55 (2004) 640--646.
  79. Urosevic D, Brimberg J and Mladenovic N. Variable neighborhood decomposition search for the edge weighted k-cardinality tree problem, Computers and Operations Research 31 (2004) 1205-1213.
  80. Crainic T, Gendreau M, Hansen P and Mladenovic N. Cooperative parallel variable neighborhood search for the p-median, J. of Heuristics 10 (2004) 289--310.

    81. 2003

  81. Hansen P and Mladenovic N , Variable neighborhood search in Hanbook of Metaheuristics (Glover and Kochenberger eds.), pp. 145 --184, Kluwer Academic Publisher, 2003.
  82. Mladenovic N, Labbe M and Hansen P. Solving the p-Center problem with Tabu search and Variable neighborhood search Networks 42 (2003) 48-64.
  83. Mladenovic N, Petrovic J, Kovacevic-Vujic ic V and Cangalovic M. Solving Spread spectrum radar polyphase code design problem by Tabu search and Variable Neighborhood search, European Journal of Operational Research 151 (2003) 389-399.
  84. Kochetov Y, Mladenovic N and Hansen P. Lokalni poisk s chereduysimisy okrestnostyami, Diskretaja Matematika, 10 (2003) 11-43.
  85. Hansen P, Mladenovic N and Moreno Perez J. Busqueda Entorno Variable, Artificial Inteligence 19 (2003) 77--92.
  86. Brimberg J, Hansen P, Lih K-W, Mladenovic N and Breton M. An oil pipeline design problem Operations Research, 51 (2003) 228--239.
  87. Belacel N, Hansen P and Mladenovic N. Fuzzy J-Means: a new heuristic for fuzzy clustering, Pattern Recognition 35 (2003) 2193--2200.

    88. 2002

  88. Hansen P and Mladenovic N. Recherche voisinage variable in Optimisation approch‰e en recherche op‰rationnelle, (J. Teghem and M. Pirlot eds.), pp. 81-100, Lavoiser, Herm‰s Science Publications, Paris, 2002.
  89. Hansen P and Mladenovic N., Variable Neighbourhood Search in Handbook of Applied Optimization,. (P. Pardalos and M. Resende eds.) pp. 221-234, Oxford University Press, New York, 2002.
  90. Hansen P and Mladenovic N. Developments in Variable Neighbourhood Search, in Esseys and Surveys in Metaheuristics (C. Ribeiro and P. Hanasen eds.), pp. 415-439, Kluwer Academic Publishers, Dordrecht 2002.
  91. Hansen P, Mladenovic N A separable approximation dynamic programming algorithm for economic dispatch with transmission losses, Yugoslav J. Oper. Res 12, 157--166, 2002.
  92. Brimberg J, Hansen P and Mladenovic N. Reduction and reformulation of quadratic programs with equality constraints, Journal of Global Optimization, 22, 39--47 2002.

    93. 2001

  93. Hansen P and Mladenovic N., Industrial Applications of Variable Neighbourhood Search, in Decision and Control in Management Science. (G. Zaccour eds.) pp. 261-274, Kluwer Academic Publishers, Dordrecht 2001.
  94. Hansen P, Mladenovic N and Perez-Brito D. Variable neighborhood decomposition search, Journal of Heuristics 7 (4) 335-350, 2001.
  95. Hansen P and Mladenovic N. Variable neighborhood search: principles and applications (invited review) European Journal of Operational Research, 130, 449-467, 2001.
  96. Hansen P. and Mladenovic N. J-Means: A new local search heuristic for minimum sum-of-squares clustering, Pattern Recognition, 34 405-413, 2001.

    Before 2001

  97. Hansen P and Mladenovic N. An introduction to Variable neighborhood search, in: Metaheuristics, Advances and Trends in Local Search Paradigms for Optimization, (S. Voss {et al.} eds.), pp.433-458, Kluwer Academic Publishers, Dordrecht, 1999.
  98. Vujosevic M, Stanojevic M and Mladenovic N., Optimization methods, DOPIS, Belgrade, 1996. (in Serbian)
  99. Hansen P, Jaumard B and Mladenovic N. How to choose k entities among n, in: Partitioning Data Sets (I. Cox, P. Hansen, B. Julesz eds.) pp. 105-116, DIMACS, Rutgers, USA, 1994.
  100. Vuic S and Mladenovic N. Location-allocation theory and the problem of selecting a location for development of building-materials open pits, in Application of computers and Operations research in the mineral industry (Kim YC eds) pp. 137-143, Soc Mining Metalurgy & Exploration Inc., Littleton, 1992.
  101. Mladenovic N. Numerical methods in Fortran 77, ITRIS Belgrade, 1990 (in Serbian).
  102. Mladenovic N, Spasic V and Jovanovic N. Numerical methods, Tehnicka knjiga, Belgrade, 1986 (in Serbian).
  103. Mladenovic N. Nonlinear Programming, in book: Algorithms and Programs in Operations Research, S. Krcevinac at al., Naucna knjiga, Belgrade, 1983. (in Serbian)
  104. du Merle O, Hansen P, Jaumard B and Mladenovic N. An interior point algorithm for minimum sum of squares clustering, SIAM Journal on Scientific Computing, 21, 1485-1505, 2000.
  105. Brimberg J, Hansen P, Mladenovic N, Taillard E. Improvements and Comparison of Heuristics for solving the Multisource Weber Problem, Operations Research, 48, 444-460, 2000.
  106. Mladenovic N, Plastria F. A note on Continuous p-defense-sum problems, Yugoslav J. Oper. Res 10, 299-302, 2000.
  107. Brimberg J and Mladenovic N. Degeneracy in the multi-source Weber problem, Mathematical Programming, 85, 13-220, 1999.
  108. Hansen P, Mladenovic N and Taillard E., Heuristic solution of the multisource Weber problem as a p-median problem, Operations Research Letters, 22, 55-62, 1998.
  109. Hansen P, Jaumard B, and Mladenovic N. Minimum sum of squares clustering in a low dimensional space, Journal of Classification, 15, 37-56, 1998.
  110. Perez D, Mladenovic N and Moreno P. A note on spanning trees for network location problems, Yugoslav Journal of Operations Research , 8, 141-145, 1998.
  111. Hansen P and Mladenovic N. Variable neighbourhood search for the p-median, Location Science, 5, 207-226, 1997.
  112. Mladenovic N and Hansen P. Variable neighbourhood search, Computers and Operations Research, 24, 1097-1100, 1997.
  113. Brimberg J and Mladenovic N. A variable neighbourhood algorithm for solving the continuous location-allocation problem, in: Studies in Location Analysis, Edited by D. Hamacher, pp.1-12, Athens, Greece, 1996.
  114. Brimberg J and Mladenovic N. Solving the continuous location - allocation problem with Tabu search, in: Studies in Location Analysis, Edited by C. Reeves, pp.23-32, Athens, Greece, 1996.
  115. Mladenovic N., Perez M, Vega J, A chain-interchange heuristic method, Yugoslav Journal of Operations Research, 6, 41-54, 1996.
  116. Brimberg J and Mladenovic N. A descent-ascent technique for solving the multi-source Weber problem, Yugoslav Journal of Operations Research, 5, 211-219, 1995.
  117. Hansen P and Mladenovic N. A comparison of algorithms for the maximum clique problem, Yugoslav Journal of Operations Research, 2, 3-13, 1992.
  118. Hansen P and Mladenovic N. Two algorithms for maximum cliques in dense graphs, GERAD Report G-92-18, University of Montreal, Canada (1992) (accepted in European Journal of Operational Research).
  119. Petric J, Krcevinac S, Martic M and Mladenovic N. Some expirience in human nutrition and institutional menu planning and programming - models, solution methods, applications, Yugoslav Journal of Operations Research , 2, 147-159, 1991.
  120. Mladenovic N and Petric J. Some properties of transportation manifold, Yugoslav Journal of Operations Research, 1, 5-71, 1991.

 

Permanent Positions

  • 2005-  :  Reader School of Mathematics, Brunel University, West London, United Kingdom.
  • 2005  :  Senior Lecturer School of Mathematics, University of Birmingham, United Kingdom.
  • 2002-2005  :  Research Professor (Scientific canceller), Mathematical Institute, Serbian Academy of Science, Belgrade, Serbia and Montenegro.
  • 2000-2002   : Higher Scientific Associate, Mathematical Institute, Serbian Academy of Science, Belgrade, Yugoslavia.
  • 2000-   : Associate Member of GERAD, (Group d'études et de recherche en analyse des décisions), University of Montreal, Canada.
  • 1993-2000: Professional Researcher, GERAD, University of Montreal, Canada.
  • 1988-1993: Associate professor, Faculty of Organizational Sciences, University of Belgrade, for the following subjects: Optimization Models and Methods, Econometrics and Decision Making.
  • 1985-1988: Assistant professor, Faculty of Organizational Sciences, University of Belgrade for  Econometrics Methods and Decision Making.
  • 1976-1985: Teacher at Mathematical High School (students 17-19 years old) for several subjects: Mathematical Modeling, Statistics, Computer Science, BASIC and FORTRAN, Cybernetics, Mathematical logic, Linear algebra.

Part-Time Positions

Visiting Positions

Professional Activities

Research Interest

  • Metaheuristic Methods (Variable Neighborhood Search, Tabu Search, etc.) in Combinatorial and Global Optimization;
  • Numerical Algorithms and Mathematical Programming Methods.
  • Location, Transportation, Clustering and Data Mining;

Education

  • Doctorate in Mathematics (Operations Research), Faculty of Organisational Sciences,
    University of Belgrade, Yugoslavia, 1988.
    Thesis: New nonlinear programming methods with application in location, allocation and transportation problems
  • MSc degree in Mathematics (Operations Research), Faculty of Organisational Sciences,
    University of Belgrade, Yugoslavia, 1982.
    Thesis: Comparative analysis of some nonlinear programming methods
  • BSc degree in Mathematics, Faculty of Mathematics,
    University of Belgrade, Yugoslavia, 1976    .