Results 1 to 10 of about 970,648 (171)
Data for a meta-analysis of the adaptive layer in adaptive large neighborhood search [PDF]
Data in Brief, 2020 Meta-analysis, a systematic statistical examination that combines the results of several independent studies, has the potential of obtaining problem- and implementation-independent knowledge and understanding of metaheuristic algorithms, but has not yet ...
Renata Turkeš +19 more
doaj +2 more sources
Seeded Graph Matching via Large Neighborhood Statistics [PDF]
Random Structures & Algorithms, 2018 We study a well known noisy model of the graph isomorphism problem. In this model, the goal is to perfectly recover the vertex correspondence between two edge-correlated Erd\H{o}s-R\'{e}nyi random graphs, with an initial seed set of correctly matched ...
Frieze A. +3 more
core +6 more sources
Explanation-Based Large Neighborhood Search [PDF]
Constraints, 2014 International audienceOne of the most well-known and widely used local search techniques for solving optimization problems in Constraint Programming is the Large Neigh-borhood Search (LNS) algorithm.
Jussien, Narendra +2 more
core +7 more sources
Large Cities Fall Behind in “Neighborhood Biodiversity” [PDF]
Frontiers in Conservation Science, 2021 Urbanization is a major driver of global species loss. While cities with suitable habitats and conservation policies may support locally-high biodiversity levels, we suspected that the complexity of managing very large cities might counteract the ...
Daniel S. Cooper +7 more
doaj +2 more sources
A remark on the second neighborhood problem [PDF]
Electronic Journal of Graph Theory and Applications, 2015 Seymour's second neighborhood conjecture states that every simple digraph (without digons) has a vertex whose first out-neighborhood is at most as large as its second out-neighborhood. Such a vertex is said to have the second neighborhood property (SNP).
Salman Ghazal
doaj +4 more sources
Mining Frequent Neighborhood Patterns in Large Labeled Graphs [PDF]
Proceedings of the 22nd ACM international conference on Information & Knowledge Management, 2013 Over the years, frequent subgraphs have been an important sort of targeted patterns in the pattern mining literatures, where most works deal with databases holding a number of graph transactions, e.g., chemical structures of compounds. These methods rely
Han, Jialong, Wen, Ji-Rong
core +3 more sources
Vertices with the second neighborhood property in Eulerian digraphs [PDF]
Opuscula Mathematica, 2019 The Second Neighborhood Conjecture states that every simple digraph has a vertex whose second out-neighborhood is at least as large as its first out-neighborhood, i.e. a vertex with the Second Neighborhood Property.
Michael Cary
doaj +3 more sources
Parallel adaptive large neighborhood search based on spark to solve VRPTW [PDF]
Scientific ReportsAiming at the multi-objective vehicle path planning problem with time windows (VRPTW), a Spark-based parallel Adaptive Large Neighborhood Search algorithm (Spark-ALNS) is proposed to solve it.
Songzuo Liu +3 more
doaj +2 more sources
Solving DCOPs with Distributed Large Neighborhood Search
, 2017 The field of Distributed Constraint Optimization has gained momentum in recent years, thanks to its ability to address various applications related to multi-agent cooperation.
Aspenberg, Per +6 more
core +3 more sources
A hybrid VNS matheuristic for a bin packing problem with a color constraint [PDF]
Yugoslav Journal of Operations Research, 2021 We study a new variant of the bin packing problem with a color constraint. Given a finite set of items, each item has a set of colors. Each bin has a color capacity, the total number of colors for a bin is the unification of colors for its items and ...
Kochetov Yury, Kondakov Arteam
doaj +1 more source