The following pages link to Raca Todosijević (Q322896):
Displayed 37 items.
- Nested general variable neighborhood search for the periodic maintenance problem (Q322899) (← links)
- Two level general variable neighborhood search for attractive traveling salesman problem (Q337241) (← links)
- A basic variable neighborhood search heuristic for the uncapacitated multiple allocation \(p\)-hub center problem (Q526415) (← links)
- J-means and I-means for minimum sum-of-squares clustering on networks (Q526420) (← links)
- General variable neighborhood search for the uncapacitated single allocation \(p\)-hub center problem (Q526421) (← links)
- A general variable neighborhood search for the swap-body vehicle routing problem (Q1652113) (← links)
- A general variable neighborhood search variants for the travelling salesman problem with draft limits (Q1677289) (← links)
- A general variable neighborhood search for solving the uncapacitated \(r\)-allocation \(p\)-hub Median problem (Q1677297) (← links)
- A general framework for nested variable neighborhood search (Q1687670) (← links)
- Novel formulations and VNS-based heuristics for single and multiple allocation \(p\)-hub maximal covering problems (Q1698283) (← links)
- Variable neighborhood search: basics and variants (Q1707084) (← links)
- Solving the capacitated clustering problem with variable neighborhood search (Q1730629) (← links)
- Probabilistic tabu search for the cross-docking assignment problem (Q1740539) (← links)
- Solving the maximum min-sum dispersion by alternating formulations of two different problems (Q1753455) (← links)
- Matheuristics based on iterative linear programming and slope scaling for multicommodity capacitated fixed charge network design (Q1754304) (← links)
- Less is more: general variable neighborhood search for the capacitated modular hub location problem (Q2002852) (← links)
- On convergence of scatter search and star paths with directional rounding for 0--1 mixed integer programs (Q2064299) (← links)
- An efficient heuristic for a hub location routing problem (Q2070128) (← links)
- Heuristic and exact reduction procedures to solve the discounted 0-1 knapsack problem (Q2079394) (← links)
- A non-triangular hub location problem (Q2191284) (← links)
- Variable neighborhood search for minimum sum-of-squares clustering on networks (Q2355953) (← links)
- Mathematical programming based heuristics for the 0--1 MIP: a survey (Q2401328) (← links)
- Solving the capacitated dispersion problem with variable neighborhood search approaches: from basic to skewed VNS (Q2669792) (← links)
- Mathematical formulations and solution methods for the uncapacitated \(r\)-allocation \(p\)-hub maximal covering problem (Q2691195) (← links)
- An efficient GVNS for solving Traveling Salesman Problem with Time Windows (Q2840756) (← links)
- VNS based heuristic for solving the Unit Commitment problem (Q2840767) (← links)
- Sum-of-squares clustering on networks (Q2853254) (← links)
- Variable Neighborhood Descent for the Capacitated Clustering Problem (Q3133226) (← links)
- Sequential variable neighborhood descent variants: an empirical study on the traveling salesman problem (Q5278229) (← links)
- An efficient General Variable Neighborhood Search for large Travelling Salesman Problem with Time Windows (Q5420849) (← links)
- A no-delay single machine scheduling problem to minimize total weighted early and late work (Q6063508) (← links)
- Variable neighborhood search for the single machine scheduling problem to minimize the total early work (Q6063510) (← links)
- Less is more approach: basic variable neighborhood search for the obnoxious <i>p</i>‐median problem (Q6066720) (← links)
- The uncapacitated <i>r</i>‐allocation <i>p</i>‐hub center problem (Q6070875) (← links)
- Multi-period single-allocation hub location-routing: models and heuristic solutions (Q6113308) (← links)
- Variable neighborhood search: the power of change and simplicity (Q6164603) (← links)
- Heuristic and exact fixation-based approaches for the discounted 0-1 knapsack problem (Q6369614) (← links)