Fence facets from non-regular graphs for the linear ordering polytope

DOI10.1007/S11590-013-0625-6MaRDI QIDQ2448162zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 30 April 2014

Published in Optimization Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11590-013-0625-6

zbMATH Keywords

facetgraph inequalitylinear ordering polytope

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

• More facets from fences for linear ordering and acyclic subgraph polytopes
• New facets for the set packing polytope
• Facets of the linear ordering polytope: a unification for the fence family through weighted graphs
• New Facets of the Linear Ordering Polytope
• A note on small linear-ordering polytopes

Cites work

• Binary Probabilities Induced by Rankings
• Facets of the linear ordering polytope
• More facets from fences for linear ordering and acyclic subgraph polytopes
• 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
• The biorder polytope

Cited in

(7)

• More facets from fences for linear ordering and acyclic subgraph polytopes
• Facets of the dynamic monopoly polytope: linear ordering formulation
• Facets of the linear ordering polytope: a unification for the fence family through weighted graphs
• The examples of non-integer vertices of the relaxation polytope of the linear ordering problem and their structure
• New Facets of the Linear Ordering Polytope
• Rank aggregation in cyclic sequences
• 0, 1/2‐Cuts and the Linear Ordering Problem: Surfaces That Define Facets

This page was built for publication: Fence facets from non-regular graphs for the linear ordering polytope

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2448162)