Results 261 to 270 of about 7,624,569 (302)
Some of the next articles are maybe not open access.
Hybridizations of evolutionary algorithms with Large Neighborhood Search
Computer Science Review, 2022Recent developments of evolutionary algorithms (EAs) for discrete optimization problems are often characterized by the hybridization of EAs with local search methods, in particular, with Large Neighborhood Search. In this survey, we consider some of the most promising directions of this kind of hybridization and provide examples in the context of well ...
Christian Blum 0001 +2 more
openaire +3 more sources
Principles for the Design of Large Neighborhood Search
Journal of Mathematical Modelling and Algorithms, 2009zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Tom Carchrae, J. Christopher Beck
openaire +2 more sources
Neural large neighborhood search for routing problems
Artificial Intelligence, 2022zbMATH Open Web Interface contents unavailable due to conflicting licenses.
André Hottung, Kevin Tierney
openaire +3 more sources
On the Panconnectivity of Graphs with Large Degrees and Neighborhood Unions
Graphs and Combinatorics, 1998It is shown that if \(G\) is a \(3\)-connected graph of order \(n\) such that for any triple of independent vertices \(\{u,v,w\}\), the \(\min \{| N(u) \cup N(v)|+ d(w), | N(u) \cup N(w)|+ d(v), | N(v) \cup N(w)|+ d(u) \} \geq n+ 1\), then \(G\) is \([7,n]\)-panconnected.
B. Wei, Y. Zhu
openaire +3 more sources
Propagation Guided Large Neighborhood Search
2004In this article, we explore how neighborhoods for the Large Neighborhood Search (LNS) framework can be automatically defined by the volume of propagation of our Constraint Programming (CP) solver. Thus we can build non trivial neighborhoods which will not be reduced to zero by propagation and whose size will be close to a parameter of the search ...
Laurent Perron +2 more
openaire +2 more sources
Large neighborhood search for LNG inventory routing
Journal of Heuristics, 2012Liquefied Natural Gas (LNG) is steadily becoming a common mode for commercializing natural gas. Due to the capital intensive nature of LNG projects, the optimal design of LNG supply chains is extremely important from a profitability perspective. Motivated by the need for a model that can assist in the design analysis of LNG supply chains, we address an
Vikas Goel +3 more
openaire +2 more sources
A Multi-paradigm Tool for Large Neighborhood Search
2013We present a general tool for encoding and solving optimization problems. Problems can be modeled using several paradigms and/or languages such as: Prolog, MiniZinc, and GECODE. Other paradigms can be included. Solution search is performed by a hybrid solver that exploits the potentiality of the Constraint Programming environment GECODE and of the ...
CIPRIANO, Raffaele +2 more
openaire +2 more sources
Neighborhood Discriminant Hashing for Large-Scale Image Retrieval
IEEE Transactions on Image Processing, 2015With the proliferation of large-scale community-contributed images, hashing-based approximate nearest neighbor search in huge databases has aroused considerable interest from the fields of computer vision and multimedia in recent years because of its computational and memory efficiency.
Jinhui Tang 0001 +3 more
openaire +2 more sources
Hamiltonian graphs with large neighborhood unions
Ars Comb., 1997For a set \(A\subset V(G)\), let \(N(A)=\bigcup _{x\in A} N(x)\). The main result reads: if \(G\) is a graph of order \(n\geq 3\) and \(k\) is a positive integer such that \(G\) is \(4(k-1)\)-connected and \(|N(S)|+|N(T)|\geq n\) for every two disjoint independent sets \(S\) and \(T\) of \(k\) vertices, then \(G\) is hamiltonian.
Guantao Chen, Yiping Liu
openaire +2 more sources