In and out forests on combinatorial landscapes

DOI10.1016/J.EJOR.2013.11.025zbMath1338.90342OpenAlexW2060564664MaRDI QIDQ299842

Eduardo L. Pasiliao, Alla R. Kammerdiner

Publication date: 23 June 2016

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2013.11.025

zbMATH Keywords

local searchdirected graphfitness landscapein forest (spanning converging forest)local optimaout forest (spanning diverging forest)

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Trees (05C05) Combinatorial optimization (90C27)

Related Items (1)

Landscape properties of the very large-scale and the variable neighborhood search metaheuristics for the multidimensional assignment problem

Cites Work

• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• On the number of local minima for the multidimensional assignment problem
• A review of metrics on permutations for search landscape analysis
• Random assignment problems
• Speeding up continuous GRASP
• On the spectra of nonsymmetric Laplacian matrices
• The matrix of maximum out forests of a digraph and its applications
• Finding local optima of high-dimensional functions using direct search methods
• Investigating a hybrid simulated annealing and local search algorithm for constrained optimization
• A genetic algorithm for the resource constrained multi-project scheduling problem
• Iterated local search for the quadratic assignment problem
• Combinatorial Landscapes
• Molecular Modeling of Proteins and Mathematical Prediction of Protein Structure

This page was built for publication: In and out forests on combinatorial landscapes