440 search results - page 52 / 88 » Local Search Heuristics for the Multidimensional Assignment ... |
GECCO
2005
Springer
14 years 1 months ago
2005
Springer
Memetic algorithms have become to gain increasingly important for solving large scale combinatorial optimization problems. Typically, the extent of the application of local search...
COR
2010
13 years 7 months ago
2010
In many real-life optimisation problems, there are multiple interacting components in a solution. For example, different components might specify assignments to different kinds of...
KDD
2006
ACM
14 years 8 months ago
2006
ACM
Privacy becomes a more and more serious concern in applications involving microdata. Recently, efficient anonymization has attracted much research work. Most of the previous metho...
UAI
2003
13 years 9 months ago
2003
The paper explores the power of two systematic Branch and Bound search algorithms that exploit partition-based heuristics, BBBT (a new algorithm for which the heuristic informatio...
GECCO
2007
Springer
14 years 1 months ago
2007
Springer
Dividing the set of nodes into clusters in the well-known traveling salesman problem results in the generalized traveling salesman problem which seeking a tour with minimum cost p...