Sciweavers

2828 search results - page 12 / 566
» Custom Local Search
Sort
View
GECCO
2000
Springer
225views Optimization» more  GECCO 2000»
14 years 1 days ago
Solving Large Binary Quadratic Programming Problems by Effective Genetic Local Search Algorithm
A genetic local search (GLS) algorithm, which is a combination technique of genetic algorithm and local search, for the unconstrained binary quadratic programming problem (BQP) is...
Kengo Katayama, Masafumi Tani, Hiroyuki Narihisa
EOR
2008
84views more  EOR 2008»
13 years 8 months ago
Complexity of local search for the p-median problem
For the p-median problem we study complexity of finding a local minimum in the worst and the average cases. We introduce several neighborhoods and show that the corresponding loca...
Ekaterina Alekseeva, Yury Kochetov, Alexander Plya...
GECCO
2007
Springer
160views Optimization» more  GECCO 2007»
14 years 2 months ago
Quick-and-dirty ant colony optimization
Ant colony optimization (ACO) is a well known metaheuristic. In the literature it has been used for tackling many optimization problems. Often, ACO is hybridized with a local sear...
Paola Pellegrini, Elena Moretti
HEURISTICS
2002
122views more  HEURISTICS 2002»
13 years 8 months ago
Complete Local Search with Memory
Neighborhood search heuristics like local search and its variants are some of the most popular approaches to solve discrete optimization problems of moderate to large size. Apart ...
Diptesh Ghosh, Gerard Sierksma
ACMICEC
2007
ACM
144views ECommerce» more  ACMICEC 2007»
14 years 13 days ago
Needs-based analysis of online customer reviews
Needs-based analysis lies at the intersection of product marketing and new product development. It is the study of why consumers purchase and what they do with those purchases. In...
Thomas Y. Lee