315 search results - page 27 / 63 » A new heuristic to solve the one-warehouse N-retailer proble... |
188
Voted
HEURISTICS
2008
15 years 6 months ago
2008
In this article we investigate a new variant of Variable Neighborhood Search (VNS): Relaxation Guided Variable Neighborhood Search. It is based on the general VNS scheme and a new...
183
Voted
ICCAD
2006
IEEE
16 years 3 months ago
2006
IEEE
The paper explores several ways to improve the speed and capacity of combinational equivalence checking based on Boolean satisfiability (SAT). State-of-the-art methods use simulat...
142
Voted
GECCO
2005
Springer
16 years 8 days ago
2005
Springer
The global search properties of heuristic search algorithms are not well understood. In this paper, we introduce a new metric, mobility, that quantifies the dispersion of local o...
200
click to vote
AE
2003
Springer
16 years 4 hour ago
2003
Springer
Abstract. The graph partitioning problem consists of dividing the vertices of a graph into a set of balanced parts, such that the number of edges connecting vertices in different ...
179
click to vote
CEC
2010
IEEE
15 years 7 months ago
2010
IEEE
Using a recently proposed model for combinatorial landscapes, Local Optima Networks (LON), we conduct a thorough analysis of two types of instances of the Quadratic Assignment Prob...