2007 · 17 citations · 7 references
BusinessDecision SciencesAlgorithmsOptimizationStatistical ModelingCombinatorial OptimizationOptimization ModelingOptimization TheoryParameter EstimationEstimation Of Distribution AlgorithmsMarkov Random FieldsRandom Fields
Markov Networks (also known as Markov Random Fields) have been proposed as a new approach to probabilistic modelling in Estimation of Distribution Algorithms (EDAs). An EDA employing this approach called Distribution Estimation Using Markov Networks (DEUM) has been proposed and shown to work well on a variety of problems, using a unique fitness modelling approach. Previously DEUM has only been demonstrated on univariate and bivariate complexity problems. Here we show that it can be extended to a difficult multivariate problem and is capable of accurately modelling a fitness function and locating an optimum with a very small number of function evaluations.
7
Optimization by Simulated Annealing
Scott Kirkpatrick, C. D. Gelatt, M.P. Vecchi · Science · 1983 · 44.6K citations
<i>Numerical Recipes, The Art of Scientific Computing</i>
William H. Press, Brian P. Flannery, Saul A. Teukolsky et al. · American Journal of Physics · 1987 · 10.1K citations
SATLIB: An Online Resource for Research on SAT
Holger H. Hoos, Thomas Stützle, Ian P. Gent et al. · 2000 · 312 citations
Approximation algorithms for combinatorial problems
David S. Johnson · 1973 · 267 citations