Sciweavers

6312 search results - page 14 / 1263
» A design framework for metaheuristics
Sort
View
ANTSW
2006
Springer
13 years 11 months ago
Kernelization as Heuristic Structure for the Vertex Cover Problem
Abstract. For solving combinatorial optimisation problems, exact methods accurately exploit the structure of the problem but are tractable only up to a certain size; approximation ...
Stephen Gilmour, Mark Dras
CEC
2010
IEEE
13 years 8 months ago
Population-Based Guided Local Search: Some preliminary experimental results
Based on the Proximate Optimality Principle in metaheuristics, a Population Based Guided Local Search (PGLS) framework for dealing with difficult combinatorial optimization problem...
Nasser Tairan, Qingfu Zhang
INFORMS
2007
150views more  INFORMS 2007»
13 years 7 months ago
SSPMO: A Scatter Tabu Search Procedure for Non-Linear Multiobjective Optimization
— We describe the development and testing of a metaheuristic procedure, based on the scatter search methodology, for the problem of approximating the efficient frontier of nonlin...
Julián Molina Luque, Manuel Laguna, Rafael ...
ANOR
2011
158views more  ANOR 2011»
13 years 2 months ago
Hybrid scatter tabu search for unconstrained global optimization
Abstract The problem of finding a global optimum of an unconstrained multimodal function has been the subject of intensive study in recent years, giving rise to valuable advances ...
Abraham Duarte, Rafael Martí, Fred Glover, ...
TOOLS
1999
IEEE
14 years 8 hour ago
A "Framework" for Object Oriented Frameworks Design
Object-oriented frameworks are an established tool for domain-specific reuse. Many framework design patterns and development processes have been documented, typically reverse engin...
David Parsons, Awais Rashid, Andreas Speck, Alexan...