Derivations of large classes of facet defining inequalities of the weak order polytope using ranking structures

DOI10.1007/s10878-023-01075-warXiv2008.03799OpenAlexW3048105141MaRDI QIDQ6084673

Romena Yasmin, Adolfo R. Escobedo

Publication date: 6 November 2023

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2008.03799

zbMATH Keywords

rankingsweak ordersorder polyhedra

Mathematics Subject Classification ID

Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorics of partially ordered sets (06A07) Combinatorial optimization (90C27)

Cites Work

• On the number of facets of polytopes representing comparative probability orders
• The linear ordering problem. Exact and heuristic methods in combinatorial optimization.
• Primary facets of order polytopes
• Facets of the clique partitioning polytope
• The median procedure in cluster analysis and social choice theory
• Induced binary probabilities and the linear ordering polytope: A status report
• Weak order polytopes.
• Facets of the graph coloring polytope
• On the partial order polytope of a digraph
• A new correlation coefficient for comparing and aggregating non-strict and incomplete rankings
• Facets of the Weak Order Polytope Derived from the Induced Partition Projection
• There Are Many Models of Transitive Preference: A Tutorial Review and Current Perspective
• Facets of the linear ordering polytope
• New Facets of the Linear Ordering Polytope
• A Definition of Subjective Probability
• THE TREATMENT OF TIES IN RANKING PROBLEMS
• A New Binary Programming Formulation and Social Choice Property for Kemeny Rank Aggregation
• Unnamed Item

This page was built for publication: Derivations of large classes of facet defining inequalities of the weak order polytope using ranking structures