Descent with mutations applied to the linear ordering problem

DOI10.1007/978-3-319-96151-4_22MaRDI QIDQ1661893zbMATH OpenOpenAlexFDO

Authors 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

simulated annealingcombinatorial optimizationmetaheuristicsmedian orderlinear ordering problemSlater's problemCondorcet-Kemeny's problemnoising methods

Mathematics Subject Classification ID

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

Recommendations

• Application of the ``descent with mutations metaheuristic to a clique partitioning problem
• A new heuristic algorithm solving the linear ordering problem
• scientific article; zbMATH DE number 1488084
• The linear ordering problem revisited
• The linear ordering problem: instances, search space analysis and algorithms

Cited in

(1)

• Application of the ``descent with mutations metaheuristic to a clique partitioning problem

This page was built for publication: Descent with mutations applied to the linear ordering problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1661893)