Sciweavers

613 search results - page 41 / 123
» Generalized Traveling Salesman Problem Reduction Algorithms
Sort
View
CEC
2008
IEEE
14 years 2 months ago
DEACO: Hybrid Ant Colony Optimization with Differential Evolution
—Ant Colony Optimization (ACO) algorithm is a novel meta-heuristic algorithm for the approximate solution of combinatorial optimization problems that has been inspired by the for...
Xiangyin Zhang, Haibin Duan, Jiqiang Jin
GECCO
2003
Springer
141views Optimization» more  GECCO 2003»
14 years 25 days ago
Finding the Optimal Gene Order in Displaying Microarray Data
The rapid advances of genome-scale sequencing have brought out the necessity of developing new data processing techniques for enormous genomic data. Microarrays, for example, can g...
Seung-Kyu Lee, Yong-Hyuk Kim, Byung Ro Moon
GECCO
2009
Springer
100views Optimization» more  GECCO 2009»
14 years 2 months ago
Partial neighborhoods of elementary landscapes
This paper introduces a new component based model that makes it relatively simple to prove that certain types of landscapes are elementary. We use the model to reconstruct proofs ...
L. Darrell Whitley, Andrew M. Sutton
SODA
2012
ACM
297views Algorithms» more  SODA 2012»
11 years 10 months ago
Constant factor approximation algorithm for the knapsack median problem
We give a constant factor approximation algorithm for the following generalization of the k-median problem. We are given a set of clients and facilities in a metric space. Each fa...
Amit Kumar
APSCC
2007
IEEE
13 years 7 months ago
Joint Sink Mobility and Data Diffusion for Lifetime Optimization in Wireless Sensor Networks
Abstract— In this paper, we address the problem of lifetime optimization under storage constraint for wireless sensor networks with a mobile sink node. The problem is particularl...
Yu Gu, Hengchang Liu, Fei Song, Baohua Zhao