A linear ordering problem of sets

DOI10.1007/s10479-019-03473-yzbMath1437.62170OpenAlexW2989964353WikidataQ126787861 ScholiaQ126787861MaRDI QIDQ2173116

Mercedes Landete, Juan Pablo Aparicio, Juan Francisco Monge

Publication date: 22 April 2020

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-019-03473-y

zbMATH Keywords

linear ordering problemrank aggregation problemKendall-\(\tau\) distance

Mathematics Subject Classification ID

Nonparametric robustness (62G35) Applications of statistics to social sciences (62P25) Order statistics; empirical distribution functions (62G30) Ordered sets and their cofinalities; pcf theory (03E04)

Related Items (2)

The linear ordering problem with clusters: a new partial ranking ⋮ A linear ordering problem with weighted rank

Cites Work

• Unnamed Item
• Rank aggregation in cyclic sequences
• The Borda majority count
• The linear ordering problem. Exact and heuristic methods in combinatorial optimization.
• Maximum distance between Slater orders and Copeland orders of tournaments
• A global optimization algorithm for generalized semi-infinite, continuous minimax with coupled constraints and bi-level problems
• An updated survey on the linear ordering problem for weighted or unweighted tournaments
• On the complexity of Slater's problems
• Probabilistic asymptotic properties of some combinatorial optimization problems
• The Benders decomposition algorithm: a literature review
• A survey on the linear ordering problem for weighted or unweighted tournaments
• Optimal Weighted Ancestry Relationships
• A Consistent Extension of Condorcet’s Election Principle
• Comparing Partial Rankings
• A NEW MEASURE OF RANK CORRELATION
• Aggregating inconsistent information

This page was built for publication: A linear ordering problem of sets