Combining variable neighborhood search and estimation of distribution algorithms in the protein side chain placement problem
DOI10.1007/S10732-007-9049-8zbMATH Open1211.90316DBLPjournals/heuristics/SantanaLL08OpenAlexW2105506484WikidataQ62637421 ScholiaQ62637421MaRDI QIDQ953320FDOQ953320
Authors: Roberto Santana, Pedro Larrañaga, José A. Lozano 
Publication date: 17 November 2008
Published in: Journal of Heuristics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10732-007-9049-8
Recommendations
Approximation methods and heuristics in mathematical programming (90C59) Applications of mathematical programming (90C90)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The naive credal classifier
- Future paths for integer programming and links to artificial intelligence
- Bayesian network classifiers
- Variable neighborhood tabu search and its application to the median cycle problem.
- Multiple Comparisons
- Variable neighborhood search
- Title not available (Why is that?)
- Variable neighborhood search: Principles and applications
- Variable Neighborhood Search
- Developments of variable neighborhood search
- A survey of optimization by building and using probabilistic models
- Towards a new evolutionary computation. Advances on estimation of distribution algorithms.
- Mathematical modelling of UMDA\(_{c}\) algorithm with tournament selection. Behaviour on linear and quadratic functions
- Hierarchical Bayesian optimization algorithm. Toward a new generation of evolutionary algorithms. With a foreword by David E. Goldberg
- PERMUTATION-BASED GENETIC, TABU, AND VARIABLE NEIGHBORHOOD SEARCH HEURISTICS FOR MULTIPROCESSOR SCHEDULING WITH COMMUNICATION DELAYS
- Heuristics for the phylogeny problem
- TABU search methodology in global optimization
- Title not available (Why is that?)
- Fuzzy J-means: a new heuristic for fuzzy clustering
- Title not available (Why is that?)
- Title not available (Why is that?)
- Evolutionary optimization and the estimation of search distributions with applications to graph bipartitioning.
Cited In (15)
- A review of distances for the Mallows and generalized Mallows estimation of distribution algorithms
- EA/G-GA for single machine scheduling problems with earliness/tardiness costs
- Quantum-inspired evolutionary algorithms: a survey and empirical study
- Variable neighbourhood search: Methods and applications
- The discretizable molecular distance geometry problem
- Molecular distance geometry methods: from continuous to discrete
- Variable neighbourhood search: methods and applications
- HPBILc: A histogram-based EDA for continuous optimization
- The Impact of Exact Probabilistic Learning Algorithms in EDAs Based on Bayesian Networks
- Harmless overfitting: using denoising autoencoders in estimation of distribution algorithms
- Discretization vertex orders in distance geometry
- Fast fitness improvements in estimation of distribution algorithms using belief propagation
- MN-EDA and the use of clique-based factorisations in EDAs
- Memory and learning in metaheuristics
- A hybrid optimization algorithm based on chaotic differential evolution and estimation of distribution
Uses Software
This page was built for publication: Combining variable neighborhood search and estimation of distribution algorithms in the protein side chain placement problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q953320)
