Quantile and mean value measures of search process complexity

DOI10.1007/s10878-018-0251-4zbMath1418.90235OpenAlexW2788285642WikidataQ130195098 ScholiaQ130195098MaRDI QIDQ1752630

Matej Mojzeš, Jaromír Kukal

Publication date: 24 May 2018

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-018-0251-4

zbMATH Keywords

optimizationperformance measurequantiletime complexitymean valuerestart strategy

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (1)

Comparison of modern heuristics on solving the phase stability testing problem

Uses Software

• QAPLIB

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
• Differential evolution. In search of solutions.
• Evaluation performance of genetic algorithm and tabu search algorithm for solving the MAX-RWA problem in all-optical networks
• Hierarchical swarm model: a new approach to optimization
• QAPLIB - a quadratic assignment problem library
• Practical mathematical optimization. An introduction to basic optimization theory and classical and new gradient-based algorithms.
• A study of search algorithms' optimization speed
• Handbook of metaheuristics

This page was built for publication: Quantile and mean value measures of search process complexity