Results 11 to 20 of about 221,837 (175)
Local Branching in a Constraint Programming Framework [PDF]
, 2010 We argue that integrating local branching in CP merges the advantages of the intensification and diversification mechanisms specific to local search methods, with constraint propagation that speeds up the neighborhood exploration by removing infeasible ...
Parisini, Fabio
core +1 more source
Multi-layer local optima networks for the analysis of advanced local search-based algorithms
, 2020 A Local Optima Network (LON) is a graph model that compresses the fitness landscape of a particular combinatorial optimization problem based on a specific neighborhood operator and a local search algorithm.
Daolio Fabio +6 more
core +1 more source
Topological variable neighborhood search
Journal of Big DataAbstract The design of the novel metaheuristic method, called Topological Variable Neighborhood Search, is presented and its theoretical properties are elaborated.The proposed metaheuristic method is implemented, applied to several well-known NP-hard problems on graphs (Metric Dimension Problem, Roman Domination Problem and Maximum Betweeness ...
Vladimir Filipović, Aleksandar Kartelj
openaire +2 more sources
Generic Pareto local search metaheuristic for optimization of targeted offers in a bi-objective direct marketing campaign [PDF]
, 2016 Cross-selling campaigns seek to offer the right products to the set of customers with the goal of maximizing expected profit, while, at the same time, respecting the purchasing constraints set by investors. In this context, a bi-objective version of this
Coelho, B.N. +9 more
core +3 more sources
, 2017 In this paper, we study various parallelization schemes for the Variable Neighborhood Search (VNS) metaheuristic on a CPU-GPU system via OpenMP and OpenACC.
Antoniadis, Nikolaos, Sifaleras, Angelo
core +1 more source
Edge-ratio network clustering by Variable Neighborhood Search [PDF]
The European Physical Journal B, 2014 The analysis of networks and in particular the identification of communities, or clusters, is a topic of active research with application arising in many domains. Several models were proposed for its solution. In [Cafieri et al., Phys. Rev. E 81(2):026105, 2010], a criterion is proposed for a graph bipartition to be optimal: one seeks to maximize the ...
Cafieri, Sonia +2 more
openaire +2 more sources
European Journal of Operational Research, 2021 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lai, Xiangjing +3 more
openaire +3 more sources
Solving the planar p-median problem by variable neighborhood and concentric searches [PDF]
, 2014 Two new approaches for the solution of the p-median problem in the plane are proposed. One is a Variable Neighborhood Search (VNS) and the other one is a concentric search.
Brimberg, Jack +3 more
core +3 more sources
Variable neighborhood search for the Vertex Separation Problem
Computers & Operations Research, 2012 The vertex separation problem belongs to a family of optimization problems in which the objective is to nd the best separator of vertices or edges in a generic graph. This optimization problem is strongly related to other well-known graph problems; such as the Path-Width, the Node Search Number or the Interval Thickness, among others ...
Duarte, Abraham +5 more
openaire +2 more sources
Orienteering problem with hotel selection: a variable neighborhood search method [PDF]
, 2012 In this research, we developed a skewed variable neighbourhood search algorithm to solve the orienteering problem (OP) with hotel selection, a non-investigated variant of the OP.
Cattruysse, D +2 more
core +1 more source