The following pages link to Nenad Mladenović (Q190033):
Displaying 50 items.
- Solving multifacility Huff location models on networks using metaheuristic and exact approaches (Q1652125) (← links)
- Variable neighborhood search variants for min-power symmetric connectivity problem (Q1652130) (← links)
- General variable neighborhood search for computing graph separators (Q1677293) (← links)
- A general variable neighborhood search for solving the uncapacitated \(r\)-allocation \(p\)-hub Median problem (Q1677297) (← links)
- Solving the clique partitioning problem as a maximally diverse grouping problem (Q1677299) (← links)
- On the aircraft conflict resolution problem: a VNS approach in a multiobjective framework (Q1687669) (← links)
- A general framework for nested variable neighborhood search (Q1687670) (← links)
- New VNP for automatic programming (Q1687679) (← links)
- A performance study on multi improvement neighborhood search strategy (Q1687681) (← links)
- Scheduling preventive railway maintenance activities with resource constraints (Q1687684) (← links)
- Clustering approach in maintenance of capillary railway network (Q1687690) (← links)
- Variable neighborhood search: basics and variants (Q1707084) (← links)
- Ascent-descent variable neighborhood decomposition search for community detection by modularity maximization (Q1730628) (← links)
- Solving the capacitated clustering problem with variable neighborhood search (Q1730629) (← links)
- Solving the maximum min-sum dispersion by alternating formulations of two different problems (Q1753455) (← links)
- Gaussian variable neighborhood search for continuous optimization (Q1761147) (← links)
- Reformulation descent applied to circle packing problems (Q1772872) (← links)
- Efficient heuristics for the minimum labeling global cut problem (Q1791898) (← links)
- Variable neighborhood decomposition search (Q1850963) (← links)
- Fuzzy J-means: a new heuristic for fuzzy clustering (Q1860175) (← links)
- Variable neighborhood decomposition search for the edge weighted \(k\)-cardinality tree problem (Q1885977) (← links)
- A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem (Q1926735) (← links)
- Variable neighborhood search for metric dimension and minimal doubly resolving set problems (Q1926742) (← links)
- Variable neighborhood search for the travelling deliveryman problem (Q1942008) (← links)
- Solving the traveling repairman problem with profits: a novel variable neighborhood search approach (Q1999008) (← links)
- Revenue maximization of Internet of things provider using variable neighbourhood search (Q2022217) (← links)
- Variable neighborhood programming for symbolic regression (Q2070125) (← links)
- An efficient heuristic for a hub location routing problem (Q2070128) (← links)
- A variable neighborhood search for the last-mile delivery problem during major infectious disease outbreak (Q2070131) (← links)
- Less is more approach in optimization: a road to artificial intelligence (Q2070138) (← links)
- Less is more: tabu search for Bipartite Qudratic Programming problem (Q2181776) (← links)
- A non-triangular hub location problem (Q2191284) (← links)
- Less is more: variable neighborhood search for integrated production and assembly in smart manufacturing (Q2215198) (← links)
- A survey on the applications of variable neighborhood search algorithm in healthcare management (Q2240705) (← links)
- New exact method for large asymmetric distance-constrained vehicle routing problem (Q2253580) (← links)
- A new local search for continuous location problems (Q2255938) (← links)
- Variable neighbourhood search for the minimum labelling Steiner tree problem (Q2267296) (← links)
- Variable neighborhood search for a two-stage stochastic programming problem with a quantile criterion (Q2287157) (← links)
- Review of basic local searches for solving the minimum sum-of-squares clustering problem (Q2325257) (← links)
- Variable neighborhood search for minimum sum-of-squares clustering on networks (Q2355953) (← links)
- Variable neighbourhood search for bandwidth reduction (Q2379517) (← links)
- On strategies to fix degenerate \(k\)-means solutions (Q2403298) (← links)
- Variable neighborhood search for stochastic linear programming problem with quantile criterion (Q2423821) (← links)
- A continuous variable neighborhood search heuristic for finding the three-dimensional structure of a molecule (Q2464208) (← links)
- Variable neighborhood search and local branching (Q2489139) (← links)
- First vs. best improvement: an empirical study (Q2489903) (← links)
- Variable neighborhood search for the vertex weighted \(k\)-cardinality tree problem (Q2576247) (← links)
- Clustering cities based on their development dynamics and variable neigborhood search (Q2631267) (← links)
- Variable neighbourhood decomposition search for \(0\)-\(1\) mixed integer programs (Q2654395) (← links)
- Solving the capacitated dispersion problem with variable neighborhood search approaches: from basic to skewed VNS (Q2669792) (← links)
