Metaheuristic downhill simplex method in combinatorial optimization

DOI10.1007/s10559-007-0106-yzbMath1142.90473OpenAlexW2006721481MaRDI QIDQ941194

L. F. Gulyanitskii, Ivan V. Sergienko

Publication date: 4 September 2008

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10559-007-0106-y

zbMATH Keywords

clusterquadratic assignment problemparallel computationscombinatorial optimization problemstochastic local searchmetaheuristic algorithms

Mathematics Subject Classification ID

Stochastic programming (90C15) Combinatorial optimization (90C27)

Related Items (5)

Classification of applied methods of combinatorial optimization ⋮ The concept of modeling packing and covering problems using modern computational geometry software ⋮ Convergence of a modified algorithm of fast probabilistic modeling ⋮ Properties of combinatorial optimization problems over polyhedral-spherical sets ⋮ Continuous representations and functional extensions in combinatorial optimization

Uses Software

• QAPLIB

Cites Work

• Unnamed Item
• QAPLIB - a quadratic assignment problem library
• Parallel Heterogeneous Metaheuristics
• Practical Genetic Algorithms

This page was built for publication: Metaheuristic downhill simplex method in combinatorial optimization