138 search results - page 21 / 28 » A Parallel Branch-and-Bound Algorithm for Computing Optimal ... |
CP
2004
Springer
14 years 27 days ago
2004
Springer
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve planning and scheduling problems. Tasks are allocated to facilities using MILP and sche...
ATMOS
2010
13 years 6 months ago
2010
In this paper we address a real world optimisation problem, the Rail Track Inspection Scheduling Problem (RTISP). This problem consists of scheduling network inspection tasks. The...
CCGRID
2009
IEEE
14 years 2 months ago
2009
IEEE
— To optimize makespan and reliability for workflow applications, most existing works use list heuristics rather than genetic algorithms (GAs) which can usually give better solut...
HIPC
2009
Springer
13 years 5 months ago
2009
Springer
Abstract--With General Purpose programmable GPUs becoming more and more popular, automated tools are needed to bridge the gap between achievable performance from highly parallel ar...
GECCO
2007
Springer
14 years 1 months ago
2007
Springer
There are many innovative proposals introduced in the literature under the evolutionary computation field, from which estimation of distribution algorithms (EDAs) is one of them....