| Publication | Date of Publication | Type |
|---|
The uncapacitated r‐allocation p‐hub center problem
International Transactions in Operational Research | 2023-11-24 | Paper |
Less is more approach: basic variable neighborhood search for the obnoxious p‐median problem
International Transactions in Operational Research | 2023-11-16 | Paper |
Variable neighborhood search for the single machine scheduling problem to minimize the total early work
Optimization Letters | 2023-11-07 | Paper |
A no-delay single machine scheduling problem to minimize total weighted early and late work
Optimization Letters | 2023-11-07 | Paper |
Multi-period single-allocation hub location-routing: models and heuristic solutions
European Journal of Operational Research | 2023-07-11 | Paper |
Variable neighborhood search: the power of change and simplicity
Computers & Operations Research | 2023-07-04 | Paper |
Mathematical formulations and solution methods for the uncapacitated \(r\)-allocation \(p\)-hub maximal covering problem
Discrete Optimization | 2023-03-29 | Paper |
Heuristic and exact reduction procedures to solve the discounted 0-1 knapsack problem
European Journal of Operational Research | 2022-09-29 | Paper |
Solving the capacitated dispersion problem with variable neighborhood search approaches: from basic to skewed VNS
Computers & Operations Research | 2022-03-09 | Paper |
An efficient heuristic for a hub location routing problem
Optimization Letters | 2022-01-21 | Paper |
On convergence of scatter search and star paths with directional rounding for 0--1 mixed integer programs
Discrete Applied Mathematics | 2022-01-05 | Paper |
Heuristic and exact fixation-based approaches for the discounted 0-1 knapsack problem
arXiv preprint | 2021-06-07 | Paper |
A non-triangular hub location problem
Optimization Letters | 2020-06-24 | Paper |
Less is more: general variable neighborhood search for the capacitated modular hub location problem
Computers & Operations Research | 2019-07-12 | Paper |
Probabilistic tabu search for the cross-docking assignment problem
European Journal of Operational Research | 2019-04-30 | Paper |
Solving the capacitated clustering problem with variable neighborhood search
Annals of Operations Research | 2019-03-06 | Paper |
A general variable neighborhood search for the swap-body vehicle routing problem
Computers & Operations Research | 2018-07-11 | Paper |
Matheuristics based on iterative linear programming and slope scaling for multicommodity capacitated fixed charge network design
European Journal of Operational Research | 2018-05-30 | Paper |
Solving the maximum min-sum dispersion by alternating formulations of two different problems
European Journal of Operational Research | 2018-05-29 | Paper |
Variable neighborhood search: basics and variants
EURO Journal on Computational Optimization | 2018-03-28 | Paper |
Novel formulations and VNS-based heuristics for single and multiple allocation \(p\)-hub maximal covering problems
Annals of Operations Research | 2018-02-15 | Paper |
Variable neighborhood descent for the capacitated clustering problem
Discrete Optimization and Operations Research | 2018-02-13 | Paper |
| A general framework for nested variable neighborhood search | 2018-01-04 | Paper |
A general variable neighborhood search for solving the uncapacitated \(r\)-allocation \(p\)-hub Median problem
Optimization Letters | 2017-11-10 | Paper |
A general variable neighborhood search variants for the travelling salesman problem with draft limits
Optimization Letters | 2017-11-10 | Paper |
Mathematical programming based heuristics for the 0--1 MIP: a survey
Journal of Heuristics | 2017-09-08 | Paper |
Sequential variable neighborhood descent variants: an empirical study on the traveling salesman problem
International Transactions in Operational Research | 2017-07-13 | Paper |
A basic variable neighborhood search heuristic for the uncapacitated multiple allocation \(p\)-hub center problem
Optimization Letters | 2017-05-12 | Paper |
J-means and I-means for minimum sum-of-squares clustering on networks
Optimization Letters | 2017-05-12 | Paper |
General variable neighborhood search for the uncapacitated single allocation \(p\)-hub center problem
Optimization Letters | 2017-05-12 | Paper |
Two level general variable neighborhood search for attractive traveling salesman problem
Computers & Operations Research | 2016-11-10 | Paper |
Nested general variable neighborhood search for the periodic maintenance problem
European Journal of Operational Research | 2016-10-07 | Paper |
Variable neighborhood search for minimum sum-of-squares clustering on networks
European Journal of Operational Research | 2015-07-28 | Paper |
An efficient general variable neighborhood search for large travelling salesman problem with time windows
Yugoslav Journal of Operations Research | 2014-06-13 | Paper |
Sum-of-squares clustering on networks
YUJOR. Yugoslav Journal of Operations Research | 2013-10-18 | Paper |
VNS based heuristic for solving the unit commitment problem
Electronic Notes in Discrete Mathematics | 2013-07-23 | Paper |
An efficient GVNS for solving traveling salesman problem with time windows
Electronic Notes in Discrete Mathematics | 2013-07-23 | Paper |
