Mladenović, Nenad
Loading...
3
0
20
0
false
Full Name
Mladenović, Nenad
ORCID
Scopus Author ID
Country
Serbia
Loading...
2
0
20
0
false
Subject
- 1 Bilinear programming | Branch-and-cut | Heuristics | Pooling problem | Variable neighborhood search
- 1 Branch and bound | Metaheuristics | Primal-dual methods | Simple plant-location problem | Variable-neighborhood search
- 1 Combinatorial optimization | General variable neighborhood search | Maximally diverse grouping problem | Skewed variable neighborhood search
- 1 Combinatorial optimization | Heaviest k-subgraph | Maximum diversity | Metaheuristics | Variable neighborhood search
- 1 Combinatorial optimization | Heuristics | Traveling repairman problem with profits | Variable neighborhood search
- 1 Data clustering | Variable neighborhood search
- 1 Degeneracy | Insertion | Location-allocation
- 1 Discrete location | Nested variable neighborhood descent | p-Hub median | Variable neighborhood search
- 1 Diversity/dispersion problem | Maximum-mean | Variable neighborhood search
Date issued
Type
- 10 Article
Results 1-10 of 10 (Search time: 0.004 seconds).
Projects
(Principal Investigator)
Results 1-3 of 3 (Search time: 0.0 seconds).
Acronym | Title | Start date | Completion | P-Investigator |
---|---|---|---|---|
PROJECT 174010 | Mathematical Modelas and Optimization Methods on Large-Scale Systems | 01-01-2011 | 31-12-2019 | Mladenović, Nenad |
PROJECT 144007 | Mathematical optimization models and methods with applications | 01-01-2006 | 31-12-2010 | Mladenović, Nenad |
PROJECT 1583 | Mathematical optimization models and methods with applications | 01-01-2002 | 31-12-2005 | Mladenović, Nenad |