0, 1/2‐Cuts and the Linear Ordering Problem: Surfaces That Define Facets
From MaRDI portal
Publication:5426879
DOI10.1137/S0895480104440985zbMath1126.05081MaRDI QIDQ5426879
Publication date: 16 November 2007
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Directed graphs (digraphs), tournaments (05C20) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (11)
Algorithms to separate \(\{0,\frac{1}{2}\}\)-Chvátal-Gomory cuts ⋮ Testing a mixture model of single-peaked preferences ⋮ A survey on the linear ordering problem for weighted or unweighted tournaments ⋮ Testing probabilistic models of choice using column generation ⋮ Commutative algebra of statistical ranking ⋮ Extended formulations for order polytopes through network flows ⋮ An updated survey on the linear ordering problem for weighted or unweighted tournaments ⋮ Facets of the linear ordering polytope: a unification for the fence family through weighted graphs ⋮ Primary facets of order polytopes ⋮ Spectra of Symmetrized Shuffling Operators ⋮ Virtual private network design over the first Chvátal closure
This page was built for publication: 0, 1/2‐Cuts and the Linear Ordering Problem: Surfaces That Define Facets
