Browsing by Subject Metaheuristics

Jump to: 0-9 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
or enter first few letters:  
Showing results 1 to 14 of 14
Issue DateTitleAuthor(s)
2010Approximating Pareto frontier using a hybrid line search approachGrosan, C; Abraham, A
2004A co-operative parallel heuristic for integer linear programming: Combining simulated annealing with branch & boundNwana, V; Darby-Dowman, K; Mitra, G
2006Combinatorial optimization and metaheuristicsConsoli, S; Darby-Dowman, K
2006Constructive Heuristics for the Minimum Labelling Spanning Tree Problem: a preliminary comparisonConsoli, S; Moreno, J A; Mladenović, N; Darby-Dowman, K
2008The development and application of metaheuristics for problems in graph theory: A computational studyConsoli, Sergio
2015Fitting censored quantile regression by variable neighborhood searchRajab, RS; Dražić, M; Mladenović, N; Mladenović, P; Yu, K
2009Greedy Randomized Adaptive Search and Variable Neighbourhood Search for the minimum labelling spanning tree problemConsoli, S; Darby-Dowman, K; Mladenović, N; Moreno-Pérez, JA
2007Heuristics based on greedy randomized adaptive search and variable neighbourhood search for the minimum labelling spanning tree problemConsoli, S; Darby-Dowman, K; Mladenović, N; Moreno-Pérez, JA
2018A hybrid approach for solving mixed binary integer programming problemsMat Shariff, Mastura Binti
2010New variants of variable neighbourhood search for 0-1 mixed integer programming and clusteringLazić, Jasmina
2021OptPlatform: metaheuristic optimisation framework for solving complex real-world problemsDzalbs, Ivars
2007Primal-dual variable neighborhood search for the simple plant-location problemHansen, P; Brimberg, J; Urosevic, D; Mladenović, N
2009Variable neighbourhood decomposition search for 0-1 mixed integer programsLazic, J; Hanafi, S; Mladenović, N; Urosevic, D
2007Variable neighbourhood search for the minimum labelling Steiner tree problemConsoli, S; Darby-Dowman, K; Mladenović, N; Moreno Perez, J A