336 search results - page 9 / 68 » Consultant-guided search algorithms for the quadratic assign... |
4OR
2010
13 years 7 months ago
2010
This paper describes a Diversification-Driven Tabu Search (D2 TS) algorithm for solving unconstrained binary quadratic problems. D2 TS is dis
MLG
2007
Springer
14 years 1 months ago
2007
Springer
As a fundamental problem in pattern recognition, graph matching has found a variety of applications in the field of computer vision. In graph matching, patterns are modeled as gr...
INFORMATICALT
2006
13 years 7 months ago
2006
Recently, genetic algorithms (GAs) and their hybrids have achieved great success in solving difficult combinatorial optimization problems. In this paper, the issues related to the ...
OL
2011
13 years 2 months ago
2011
We consider sequential quadratic programming (SQP) methods for solving constrained nonlinear programming problems. It is generally believed that SQP methods are sensitive to the a...
GECCO
2005
Springer
14 years 29 days 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...