Nenad Mladenović
Nenad Mladenović publishes mostly in Industrial and Manufacturing Engineering, Artificial Intelligence and Organizational Behavior and Human Resource Management, on topics such as Vehicle Routing Optimization Methods, Metaheuristic Optimization Algorithms Research and Facility Location and Emergency Management.
- World rank
- #140,463 of 7,710,434 ranked researchers
- Rank in Serbia
- #39 of 18,168
- Works
- 389
- Citations
- 19k
- Citations per work
- 47.6
What does Nenad Mladenović research?
Nenad Mladenović's work is mostly in Engineering (32%), Computer Science (29%), Business, Management and Accounting (8%).
Their six largest subfields, inside their fields and domains; the grey slice is everything else they publish. The interactive view splits every one of their works down to single topics.
The fields and subfields, with their numbers
- Physical Sciences23560.3%
- Engineering12331.5%
- Computer Science11228.8%
- Everything else12432.0%
- Social Sciences307.7%
- 1Industrial and Manufacturing Engineering32% of their works
- 2Artificial Intelligence13% of their works
- 3Organizational Behavior and Human Resource Management8% of their works
- 4Computer Networks and Communications7% of their works
- 5Computational Theory and Mathematics5% of their works
- 6Signal Processing4% of their works
Research topics
- Vehicle Routing Optimization Methods
- Metaheuristic Optimization Algorithms Research
- Facility Location and Emergency Management
- Optimization and Packing Problems
- Data Management and Algorithms
- Advanced Manufacturing and Logistics Optimization
- Advanced Clustering Algorithms Research
- Optimization and Search Problems
Which keywords describe Nenad Mladenović's research?
The keywords of their largest research topics: Metaheuristics, Heuristic Algorithms, Tabu Search, Vehicle Routing Problem, Evolutionary Algorithms, Differential Evolution, Particle Swarm Optimization and Disaster Relief.
- Online Algorithms
- K-means
- Warehouse Design
- Trajectory Data Mining
- Packing
- Clustering Algorithms
- Disaster Relief
- Differential Evolution
- Vehicle Routing Problem
- Heuristic Algorithms
- Metaheuristics
- Tabu Search
- Evolutionary Algorithms
- Particle Swarm Optimization
- Humanitarian Logistics
- Cutting
- GPS Trajectories
- Order Picking
- Cluster Validation
- Mobile Robots
Size is their works in the topics tagged with each word, from their 8 largest topics. Each links to the topic it comes from most. The words come from the keyword list OpenAlex gives each topic, not from the text of the papers, so a word can appear that none of the papers uses.
All 20 words, with their numbers
- Metaheuristics2862 topics
- Heuristic Algorithms2622 topics
- Tabu Search2021 topic
- Vehicle Routing Problem2021 topic
- Evolutionary Algorithms1132 topics
- Differential Evolution841 topic
- Particle Swarm Optimization841 topic
- Disaster Relief821 topic
- Humanitarian Logistics821 topic
- Clustering Algorithms742 topics
- Cutting601 topic
- Packing601 topic
- GPS Trajectories451 topic
- Trajectory Data Mining451 topic
- Order Picking301 topic
- Warehouse Design301 topic
- Cluster Validation291 topic
- K-means291 topic
- Mobile Robots291 topic
- Online Algorithms291 topic
Where does Nenad Mladenović work?
Nenad Mladenović's main affiliation in the publication record is Serbian Academy of Sciences and Arts, Serbia.
How many publications and citations does Nenad Mladenović have?
OpenAlex counts 389 works and 18,504 citations for Nenad Mladenović, an h-index of 59, ranking #140,463 of 7,710,434 researchers worldwide on the quality score.
Ranked on field-normalised citation excellence (50%), output (30%) and citations (20%). Counts come from OpenAlex author records, which occasionally merge different people who share a name or split one person into several.
Papers, co-authors, who cited this work and researchers on the nearest topics have tabs of their own, above. Is this your page? Claim it with your ORCID iD, or request a correction or removal.
Discussion
Ask a question or share a note about Nenad Mladenović. Keep it to the research: no personal attacks, advertising or links. Any reader can report a post, which collapses it for everyone until it is opened.