Facets of the linear ordering polytope: a unification for the fence family through weighted graphs
From MaRDI portal
(Redirected from Publication:2497757)
Recommendations
Cites work
- 0, 1/2‐Cuts and the Linear Ordering Problem: Surfaces That Define Facets
- A first family of edge-critical wheels
- A necessary but insufficient condition for the stochastic binary choice problem
- A Problem in Graph Theory
- A representation theorem for finite random scale systems
- A short proof of a theorem of Falmagne.
- A Theorem on k-Saturated Graphs
- Binary Probabilities Induced by Rankings
- Composite measurement
- Critical facets of the stable set polytope
- Determining the automorphism group of the linear ordering polytope
- Facets of the linear ordering polytope
- Facets with fixed defect of the stable set polytope
- Geometric and combinatorial properties of the polytope of binary choice probabilities
- How to recycle your facets
- scientific article; zbMATH DE number 2186863 (Why is no real title available?)
- scientific article; zbMATH DE number 3156726 (Why is no real title available?)
- scientific article; zbMATH DE number 3166040 (Why is no real title available?)
- scientific article; zbMATH DE number 3733982 (Why is no real title available?)
- scientific article; zbMATH DE number 3482392 (Why is no real title available?)
- scientific article; zbMATH DE number 487720 (Why is no real title available?)
- scientific article; zbMATH DE number 568855 (Why is no real title available?)
- scientific article; zbMATH DE number 2203240 (Why is no real title available?)
- scientific article; zbMATH DE number 3291000 (Why is no real title available?)
- scientific article; zbMATH DE number 3325511 (Why is no real title available?)
- scientific article; zbMATH DE number 3064989 (Why is no real title available?)
- scientific article; zbMATH DE number 3086059 (Why is no real title available?)
- Kanten-kritische Graphen mit der Zusammenhangszahl 2
- Matching theory
- Mixtures of order matrices and generalized order matrices
- More facets from fences for linear ordering and acyclic subgraph polytopes
- New Facets of the Linear Ordering Polytope
- On a family of line-critical graphs
- On a generalization of linecritical graphs
- On Indecomposable Graphs
- On realizable biorders and the biorder dimension of a relation
- On the acyclic subgraph polytope
- On the critical lines of a graph
- Random utility representation of binary choice probabilities: A new class of necessary conditions
- Random utility representation of binary choice probabilities: Critical graphs yielding critical necessary conditions
- Set packing relaxations of some integer programs
- Stability critical graphs and even subdivisions of \(K_ 4\)
- Stability critical graphs and ranks facets of the stable set polytope
- The biorder polytope
Cited in
(17)- Weighted graphs defining facets: A connection between stable set and linear ordering polytopes
- Ranking hypotheses to minimize the search cost in probabilistic inference models
- More facets from fences for linear ordering and acyclic subgraph polytopes
- Testing probabilistic models of choice using column generation
- Extended formulations for order polytopes through network flows
- A correct response model in knowledge structure theory
- \textsc{QTest} 2.1: quantitative testing of theories of binary choice using Bayesian inference
- Bayesian inference and model comparison for random choice structures
- Fence facets from non-regular graphs for the linear ordering polytope
- How to recycle your facets
- A survey on the linear ordering problem for weighted or unweighted tournaments
- On a weighted generalization of α-critical graphs
- scientific article; zbMATH DE number 1757965 (Why is no real title available?)
- Derivations of large classes of facet defining inequalities of the weak order polytope using ranking structures
- A polyhedral study of a relaxation of the routing and spectrum allocation problem
- Applying mod-\(k\)-cuts for solving linear ordering problems
- An updated survey on the linear ordering problem for weighted or unweighted tournaments
This page was built for publication: Facets of the linear ordering polytope: a unification for the fence family through weighted graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2497757)
