Descent with mutations applied to the linear ordering problem

DOI10.1007/978-3-319-96151-4_22zbMath1403.90573OpenAlexW2883572571MaRDI QIDQ1661893

Olivier Hudry

Publication date: 17 August 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-96151-4_22

zbMATH Keywords

combinatorial optimizationmetaheuristicssimulated annealingmedian orderlinear ordering problemSlater's problemCondorcet-Kemeny's problemnoising methods

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items

Application of the “descent with mutations” metaheuristic to a clique partitioning problem