Searching for "Tree Local Search." – sorted by Relevance.
-
Local Search Algorithms for the k-Cardinality Tree Problem
- Local Search Algorithms for the k-Cardinality Tree Problem Christian Blum, Matthias Ehrgott
- Cited by 6 (2 self) – Add To MetaCart
-
Variable Neighborhood Search For The Degree-Constrained Minimum Spanning Tree Problem
- optimization, degree-constrained minimum spanning tree, local search, metaheuristics, variable neighborhoods 1
- Cited by 8 (3 self) – Add To MetaCart
-
A Memetic Algorithm for Phylogenetic Reconstruction with Maximum Parsimony Jean-Michel Richer 1,AdrienGoëffon 2, and Jin-Kao Hao 1
- algorithm (implemented in the software Hydra) which is based on an integration of an effective local search
- Add To MetaCart
-
Improving Global Constraints Support by Local Search
- of this oracle is enhanced by local search improvements of this support tuple at each node of the search tree. 1
- Cited by 3 (1 self) – Add To MetaCart
-
How does constraint technology Meet Industrial Constraints
- and local search methods. Tree search methods use a problem decomposition scheme for producing solutions
- Cited by 1 (1 self) – Add To MetaCart
-
Robot Localization and Exploration with Agent-Centered Search
- , and the lookahead is an external parameter. We refer to all nonleaves of the minimax tree as the local search space
- Add To MetaCart
-
On the Steiner Tree 3/2-Approximation For Quasi-Bipartite Graphs
- by Rajagopalan and Vazirani in [1], the following local search algorithm returns a 3 2 -optimal Steiner tree, i
- Cited by 1 (0 self) – Add To MetaCart
-
Approximate processing of multiway spatial joins in very large databases
- heuristics, such as local and evolutionary search, with spatial indexing (R-trees) in order to quickly locate
- Cited by 4 (0 self) – Add To MetaCart
-
Fast and Memory Efficient Implementation of the Exact PNN
- ]. It uses - tree for localizing the search for the code vectors, and it merges several vector pairs
- Cited by 3 (2 self) – Add To MetaCart
-
Dynamic ordered sets with exponential search trees
- , we just return its predecessor. In our exponential search trees, the local search at each internal
- Cited by 5 (1 self) – Add To MetaCart

