Sciweavers

440 search results - page 25 / 88
» Local Search Heuristics for the Multidimensional Assignment ...
Sort
View
COMGEO
2004
ACM
13 years 7 months ago
A local search approximation algorithm for k-means clustering
In k-means clustering we are given a set of n data points in d-dimensional space d and an integer k, and the problem is to determine a set of k points in d , called centers, to mi...
Tapas Kanungo, David M. Mount, Nathan S. Netanyahu...
GECCO
2007
Springer
153views Optimization» more  GECCO 2007»
14 years 1 months ago
Parallel genetic algorithm: assessment of performance in multidimensional scaling
Visualization of multidimensional data by means of Multidimensional Scaling (MDS) is a popular technique of exploratory data analysis widely usable, e.g. in analysis of bio-medica...
Antanas Zilinskas, Julius Zilinskas
JCO
1998
136views more  JCO 1998»
13 years 7 months ago
A Greedy Randomized Adaptive Search Procedure for the Feedback Vertex Set Problem
Abstract. A Greedy Randomized Adaptive Search Procedure (GRASP) is a randomized heuristic that has produced high quality solutions for a wide range of combinatorial optimization pr...
Panos M. Pardalos, Tianbing Qian, Mauricio G. C. R...
COR
2006
108views more  COR 2006»
13 years 7 months ago
Variable neighborhood search and local branching
In this paper we develop a variable neighborhood search (VNS) heuristic for solving mixed-integer programs (MIPs). It uses CPLEX, the general-purpose MIP solver, as a black-box. N...
Pierre Hansen, Nenad Mladenovic, Dragan Urosevic
AIPS
2004
13 years 9 months ago
A Lookahead Strategy for Heuristic Search Planning
The planning as heuristic search framework, initiated by the planners ASP from Bonet, Loerincs and Geffner, and HSP from Bonet and Geffner, lead to some of the most performant pla...
Vincent Vidal