Sciweavers

1171 search results - page 29 / 235
» Variable neighborhood search
Sort
View
CADE
2004
Springer
14 years 11 months ago
Uniform variable splitting
ended abstract motivates and presents techniques for identifying variable independence in free variable calculi for classical logic without equality. Two variables are called indep...
Roger Antonsen
EVOW
2008
Springer
14 years 18 days ago
Improving Metaheuristic Performance by Evolving a Variable Fitness Function
In this paper we study a complex real world workforce scheduling problem. We apply constructive search and variable neighbourhood search (VNS) metaheuristics and enhance these meth...
Keshav P. Dahal, Stephen Remde, Peter I. Cowling, ...
CORR
2010
Springer
117views Education» more  CORR 2010»
13 years 11 months ago
Evaluating and Improving Modern Variable and Revision Ordering Strategies in CSPs
A key factor that can dramatically reduce the search space during constraint solving is the criterion under which the variable to be instantiated next is selected. For this purpos...
Thanasis Balafoutis, Kostas Stergiou
EOR
2008
84views more  EOR 2008»
13 years 11 months ago
Complexity of local search for the p-median problem
For the p-median problem we study complexity of finding a local minimum in the worst and the average cases. We introduce several neighborhoods and show that the corresponding loca...
Ekaterina Alekseeva, Yury Kochetov, Alexander Plya...
EVOW
2009
Springer
14 years 3 months ago
Finding Balanced Incomplete Block Designs with Metaheuristics
This paper deals with the generation of balanced incomplete block designs (BIBD), a hard constrained combinatorial problem with multiple applications. This problem is here formulat...
David Rodríguez Rueda, Carlos Cotta, Antoni...