New Facets of the Linear Ordering Polytope
DOI10.1137/S0895480196300145zbMATH Open0966.90085DBLPjournals/siamdm/BolotashviliKG99OpenAlexW1982740627WikidataQ29012609 ScholiaQ29012609MaRDI QIDQ4699161FDOQ4699161
Authors: G. G. Bolotashvili, Michail M. Kovalev, Eberhard Girlich 
Publication date: 23 November 1999
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0895480196300145
Recommendations
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Fundamental topics (basic mathematics, methodology; applicable to economics in general) (91B02)
Cited In (29)
- A family of efficient six-regular circulants representable as a Kronecker product
- Applying mod-\(k\)-cuts for solving linear ordering problems
- \textsc{QTest} 2.1: quantitative testing of theories of binary choice using Bayesian inference
- Determining the automorphism group of the linear ordering polytope
- A combinatorial study of partial order polytopes
- Levelness of Order Polytopes
- Facets of linear signed order polytopes.
- Workload balancing and loop layout in the design of a flexible manufacturing system
- Bayesian network learning via topological order
- More facets from fences for linear ordering and acyclic subgraph polytopes
- The examples of non-integer vertices of the relaxation polytope of the linear ordering problem and their structure
- 0, 1/2‐Cuts and the Linear Ordering Problem: Surfaces That Define Facets
- DECOMPOSITION AND PARALLELIZATION TECHNIQUES FOR ENUMERATING THE FACETS OF COMBINATORIAL POLYTOPES
- Facets of the linear ordering polytope
- Analysis of multinomial models under inequality constraints: applications to measurement theory
- Fence facets from non-regular graphs for the linear ordering polytope
- The polytope of \(m\)-subspaces of a finite affine space
- Facets of the linear ordering polytope: a unification for the fence family through weighted graphs
- An updated survey on the linear ordering problem for weighted or unweighted tournaments
- An approval-voting polytope for linear orders
- Weak order polytopes.
- Revised GRASP with path-relinking for the linear ordering problem
- The biorder polytope
- A survey on the linear ordering problem for weighted or unweighted tournaments
- Probabilistic biclassification and random variable representations
- Title not available (Why is that?)
- How to recycle your facets
- Binary choice, subset choice, random utility, and ranking: a unified perspective using the permutahedron
- Derivations of large classes of facet defining inequalities of the weak order polytope using ranking structures
Uses Software
This page was built for publication: New Facets of the Linear Ordering Polytope
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4699161)
