Sciweavers

660 search results - page 20 / 132
» Hybrid CSP Solving
Sort
View
146
Voted
ESA
2000
Springer
112views Algorithms» more  ESA 2000»
15 years 7 months ago
Resource Constrained Shortest Paths
The resource constrained shortest path problem (CSP) asks for the computation of a least cost path obeying a set of resource constraints. The problem is NP-complete. We give theore...
Kurt Mehlhorn, Mark Ziegelmann
116
Voted
ENGL
2007
121views more  ENGL 2007»
15 years 3 months ago
A Comparison between Genetic Algorithms and Evolutionary Programming based on Cutting Stock Problem
—Genetic Algorithms (GA) and Evolutionary Programming (EP) are two well-known optimization methods that belong to the class of Evolutionary Algorithms (EA). Both methods have gen...
Raymond Chiong, Ooi Koon Beng
60
Voted
ATAL
2009
Springer
15 years 10 months ago
A hybrid approach to solving coarse-grained DisCSPs
David Lee, Inés Arana, Hatem Ahriz, Kit-Yin...
108
Voted
IPPS
2006
IEEE
15 years 9 months ago
A parallel exact hybrid approach for solving multi-objective problems on the computational grid
Mohand-Said Mezmaz, Nouredine Melab, El-Ghazali Ta...