New Facets of the Linear Ordering Polytope

DOI10.1137/S0895480196300145MaRDI QIDQ4699161zbMATH OpenOpenAlexDBLPWikidataFDO

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

zbMATH Keywords

rankingfacetslinear orderinglinear ordering polytope

Mathematics Subject Classification ID

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)

Recommendations

• Facets of the linear ordering polytope
• More facets from fences for linear ordering and acyclic subgraph polytopes
• Fence facets from non-regular graphs for the linear ordering polytope
• A Cutting Plane Algorithm for the Linear Ordering Problem

Cited in

(29)

• Bayesian network learning via topological order
• scientific article; zbMATH DE number 3902051 (Why is no real title available?)
• Probabilistic biclassification and random variable representations
• Levelness of Order Polytopes
• Binary choice, subset choice, random utility, and ranking: a unified perspective using the permutahedron
• \textsc{QTest} 2.1: quantitative testing of theories of binary choice using Bayesian inference
• Workload balancing and loop layout in the design of a flexible manufacturing system
• Revised GRASP with path-relinking for the linear ordering problem
• How to recycle your facets
• The polytope of \(m\)-subspaces of a finite affine space
• Analysis of multinomial models under inequality constraints: applications to measurement theory
• Fence facets from non-regular graphs for the linear ordering polytope
• An approval-voting polytope for linear orders
• An updated survey on the linear ordering problem for weighted or unweighted tournaments
• 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
• Facets of linear signed order polytopes.
• DECOMPOSITION AND PARALLELIZATION TECHNIQUES FOR ENUMERATING THE FACETS OF COMBINATORIAL POLYTOPES
• Determining the automorphism group of the linear ordering polytope
• A combinatorial study of partial order polytopes
• Weak order polytopes.
• A family of efficient six-regular circulants representable as a Kronecker product
• A survey on the linear ordering problem for weighted or unweighted tournaments
• Applying mod-\(k\)-cuts for solving linear ordering problems
• The biorder polytope
• Derivations of large classes of facet defining inequalities of the weak order polytope using ranking structures
• Facets of the linear ordering polytope: a unification for the fence family through weighted graphs
• Facets of the linear ordering polytope

Describes a project that uses

Uses Software

• LOLIB

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)