The following pages link to Nenad Mladenović (Q190033):
Displaying 36 items.
- (Q4826162) (← links)
- (Q4883008) (← links)
- (Q4924981) (← links)
- A separable approximation dynamic programming algorithm for economic dispatch with transmission losses (Q4928120) (← links)
- (Q4928170) (← links)
- Decomposition/Aggregation K-means for Big Data (Q4965129) (← links)
- A heuristic hybrid framework for vector job scheduling (Q4987672) (← links)
- Using injection points in reformulation local search for solving continuous location problems (Q4987696) (← links)
- Variable neighborhood formulation search approach for the multi-item capacitated lot-sizing problem with time windows and setup times (Q4987698) (← links)
- Less is more: Simplified Nelder-Mead method for large unconstrained optimization (Q4987781) (← links)
- Dichotomy Algorithms in the Multi-class Problem of Pattern Recognition (Q5110854) (← links)
- Continuous Variable Neighborhood Search (C-VNS) for Solving Systems of Nonlinear Equations (Q5138256) (← links)
- Variable Neighborhood Programming as a Tool of Machine Learning (Q5153506) (← links)
- Comparison of metaheuristics for the <i>k</i>‐labeled spanning forest problem (Q5278227) (← links)
- Sequential variable neighborhood descent variants: an empirical study on the traveling salesman problem (Q5278229) (← links)
- New variable neighbourhood search based 0-1 MIP heuristics (Q5278851) (← links)
- (Q5379095) (← links)
- Continuous variable neighbourhood search with modified Nelder–Mead for non-differentiable optimization (Q5382678) (← links)
- A large neighbourhood search heuristic for covering designs (Q5382679) (← links)
- An efficient General Variable Neighborhood Search for large Travelling Salesman Problem with Time Windows (Q5420849) (← links)
- Decomposition strategies for large-scale continuous location–allocation problems (Q5427774) (← links)
- Formulation Space Search for Circle Packing Problems (Q5429303) (← links)
- (Q5431858) (← links)
- Variable neighbourhood search for colour image quantization (Q5432696) (← links)
- PERMUTATION-BASED GENETIC, TABU, AND VARIABLE NEIGHBORHOOD SEARCH HEURISTICS FOR MULTIPROCESSOR SCHEDULING WITH COMMUNICATION DELAYS (Q5708845) (← links)
- New MIP model for multiprocessor scheduling problem with communication delays (Q5915741) (← links)
- New MIP model for multiprocessor scheduling problem with communication delays (Q5919623) (← links)
- Variable neighborhood search: Principles and applications (Q5937708) (← links)
- J-MEANS: A new local search heuristic for minimum sum of squares clustering (Q5957595) (← links)
- A general variable neighborhood search approach for the minimum load coloring problem (Q6063505) (← links)
- A no-delay single machine scheduling problem to minimize total weighted early and late work (Q6063508) (← links)
- A two-phase multi-objective metaheuristic for a green UAV grid routing problem (Q6063517) (← links)
- Less is more approach: basic variable neighborhood search for the obnoxious <i>p</i>‐median problem (Q6066720) (← links)
- Exponential quality function for community detection in complex networks (Q6088242) (← links)
- Variable neighborhood search approach with intensified shake for monitor placement (Q6179684) (← links)
- Simulation-based variable neighborhood search for optimizing skill assignments in multi-server facilities with inventories (Q6551153) (← links)
