1171 search results - page 91 / 235 » Variable neighborhood search |
GECCO
2010
Springer
15 years 4 months ago
2010
Springer
The Quadratic Assignment Problem (QAP) is a well-known NP-hard combinatorial optimization problem that is at the core of many real-world optimization problems. We prove that QAP c...
99
Voted
CGI
2006
IEEE
15 years 4 months ago
2006
IEEE
This paper tackles a particular shape matching problem: given a data base of shapes (described as triangular meshes), we search for all shapes which describe a human. We do so by a...
101
Voted
AAAI
2007
15 years 3 months ago
2007
In recent years, the size of combinatorial applications and the need to produce high-quality solutions quickly have increased steadily, providing significant challenges for optim...
126
Voted
AE
2009
Springer
15 years 1 months ago
2009
Springer
Abstract. This paper presents a new Memetic Algorithm (MA) designed to compute near-optimal solutions for the covering array construction problem. It incorporates several distingui...
95
Voted
EOR
2008
15 years 24 days ago
2008
We study the one-machine scheduling problem with release dates and we look at several objective functions including total (weighted) tardiness and total (weighted) completion time...