8 search results - page 1 / 2 » A Hybrid Approach to Determining the Best Combination on Pro... |
KES
2005
Springer
13 years 10 months ago
2005
Springer
CPAIOR
2010
Springer
13 years 3 months ago
2010
Springer
Finite domain propagation solving, the basis of constraint programming (CP) solvers, allows building very high-level models of problems, and using highly specific inference encapsu...
ENGL
2006
13 years 5 months ago
2006
Hybrid genetic algorithms have received significant interest in recent years and are being increasingly used to solve real-world problems. A genetic algorithm is able to incorporat...
CP
2004
Springer
13 years 10 months ago
2004
Springer
In this talk we present a number of problems for network design, planning and analysis and show how they can be addressed with different hybrid CP solutions. Clearly, this problem...
TASE
2008
IEEE
13 years 5 months ago
2008
IEEE
Dynamic programming, branch-and-bound, and constraint programming are the standard solution principles for nding optimal solutions to machine scheduling problems. We propose a new ...