Un algorithme pour pallier l'effet Condorcet

DOI10.1051/RO/1977110100771zbMATH Open0356.90068OpenAlexW2587104335MaRDI QIDQ4128286FDOQ4128286

Authors: Alain Guénoche 

Publication date: 1977

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/104656

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35)

Cited In (6)

• A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments
• An updated survey on the linear ordering problem for weighted or unweighted tournaments
• Single or multiple consensus for linear orders
• A survey on the linear ordering problem for weighted or unweighted tournaments
• The median procedure in cluster analysis and social choice theory
• Median linear orders: Heuristics and a branch and bound algorithm

This page was built for publication: Un algorithme pour pallier l'effet Condorcet

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