Facets of the linear ordering polytope: a unification for the fence family through weighted graphs

DOI10.1016/j.jmp.2006.01.001zbMath1096.05050OpenAlexW2048940061MaRDI QIDQ2497757

Gwenaël Joret, Jean-Paul Doignon, Samuel Fiorini

Publication date: 4 August 2006

Published in: Journal of Mathematical Psychology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jmp.2006.01.001

zbMATH Keywords

linear ordering polytopefacet-defining inequalitystability-critical graphbinary choice polytopefence inequality

Mathematics Subject Classification ID

Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Integer programming (90C10) Graph theory (05C99)

Related Items (12)

Applying mod-\(k\)-cuts for solving linear ordering problems ⋮ A survey on the linear ordering problem for weighted or unweighted tournaments ⋮ Testing probabilistic models of choice using column generation ⋮ Extended formulations for order polytopes through network flows ⋮ A correct response model in knowledge structure theory ⋮ An updated survey on the linear ordering problem for weighted or unweighted tournaments ⋮ How to recycle your facets ⋮ Weighted graphs defining facets: A connection between stable set and linear ordering polytopes ⋮ Ranking hypotheses to minimize the search cost in probabilistic inference models ⋮ \textsc{QTest} 2.1: quantitative testing of theories of binary choice using Bayesian inference ⋮ Bayesian inference and model comparison for random choice structures ⋮ On a weighted generalization of α-critical graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Random utility representation of binary choice probabilities: A new class of necessary conditions
• Critical facets of the stable set polytope
• On realizable biorders and the biorder dimension of a relation
• Matching theory
• On a generalization of linecritical graphs
• Geometric and combinatorial properties of the polytope of binary choice probabilities
• A first family of edge-critical wheels
• Mixtures of order matrices and generalized order matrices
• A representation theorem for finite random scale systems
• Stability critical graphs and even subdivisions of \(K_ 4\)
• More facets from fences for linear ordering and acyclic subgraph polytopes
• A short proof of a theorem of Falmagne.
• Set packing relaxations of some integer programs
• Facets with fixed defect of the stable set polytope
• The biorder polytope
• A necessary but insufficient condition for the stochastic binary choice problem
• Random utility representation of binary choice probabilities: Critical graphs yielding critical necessary conditions
• Stability critical graphs and ranks facets of the stable set polytope
• How to recycle your facets
• On the critical lines of a graph
• On a family of line-critical graphs
• Composite measurement
• Kanten-kritische Graphen mit der Zusammenhangszahl 2
• On the acyclic subgraph polytope
• Facets of the linear ordering polytope
• New Facets of the Linear Ordering Polytope
• A Problem in Graph Theory
• A Theorem on k-Saturated Graphs
• 0, 1/2‐Cuts and the Linear Ordering Problem: Surfaces That Define Facets
• On Indecomposable Graphs
• Binary Probabilities Induced by Rankings
• Determining the automorphism group of the linear ordering polytope

This page was built for publication: Facets of the linear ordering polytope: a unification for the fence family through weighted graphs