Strong Condorcet criterion for the linear ordering problem

MaRDI QIDQ5104419zbMATH OpenFDO

Authors Kazutoshi Ando, Noriyoshi Sukegawa, Shota Takagi

Publication date 9 September 2022

zbMATH Keywords

combinatorial optimizationCondorcet criterionKemeny orderlinear ordering problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

• Publication:4730974
• An updated survey on the linear ordering problem for weighted or unweighted tournaments
• A survey on the linear ordering problem for weighted or unweighted tournaments
• The linear ordering problem with clusters: a new partial ranking
• A Cutting Plane Algorithm for the Linear Ordering Problem

Cited in

(8)

• An approval-voting polytope for linear orders
• Fairness and the set of optimal rankings for the linear ordering problem
• A survey on the linear ordering problem for weighted or unweighted tournaments
• Constructing a strict total order for alternatives characterized by multiple criteria: An extension
• scientific article; zbMATH DE number 4116248 (Why is no real title available?)
• A linear ordering problem with weighted rank
• The linear ordering problem with clusters: a new partial ranking
• An updated survey on the linear ordering problem for weighted or unweighted tournaments

This page was built for publication: Strong Condorcet criterion for the linear ordering problem

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