137 search results - page 5 / 28 » An Improved Integer Local Search for Complex Scheduling Prob... |
95
Voted
CP
2005
Springer
15 years 6 months ago
2005
Springer
This paper describes a hybrid approach to solving large-scale constraint satisfaction and optimization problems. It describes a hybrid algorithm for integer linear programming whic...
COR
2008
15 years 1 months ago
2008
The typical inventory routing problem deals with the repeated distribution of a single product from a single facility with an unlimited supply to a set of customers that can all b...
126
Voted
AIPS
2007
15 years 3 months ago
2007
In this paper, we propose an extended local search framework to solve combinatorial optimization problems with data uncertainty. Our approach represents a major departure from sce...
124
Voted
IJCAI
2001
15 years 2 months ago
2001
Much excitement has been generated by the success of stochastic local search procedures at finding solutions to large, very hard satisfiability problems. Many of the problems on wh...
100
Voted
EVOW
2008
Springer
15 years 2 months ago
2008
Springer
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...