How to recycle your facets

DOI10.1016/J.DISOPT.2005.10.007MaRDI QIDQ2506820zbMATH OpenOpenAlexFDO

Authors Samuel Fiorini

Publication date 10 October 2006

Published in Discrete Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disopt.2005.10.007

zbMATH Keywords

facetset covering polytopelinear ordering polytope0-1-polytopeacyclic subgraph polytope

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85) Boolean programming (90C09)

Recommendations

• More facets from fences for linear ordering and acyclic subgraph polytopes
• Facets of the linear ordering polytope
• On the acyclic subgraph polytope
• Generating facets for the independence system polytope
• The strongest facets of the acyclic subgraph polytope are unknown

Cites work

• scientific article; zbMATH DE number 3888925 (Why is no real title available?)
• scientific article; zbMATH DE number 3902051 (Why is no real title available?)
• scientific article; zbMATH DE number 1498519 (Why is no real title available?)
• scientific article; zbMATH DE number 1538119 (Why is no real title available?)
• scientific article; zbMATH DE number 2159270 (Why is no real title available?)
• scientific article; zbMATH DE number 1432797 (Why is no real title available?)
• scientific article; zbMATH DE number 3291000 (Why is no real title available?)
• A combinatorial study of partial order polytopes
• All 0-1 polytopes are traveling salesman polytopes
• Anti-Hadamard matrices, coin weighing, threshold gates, and indecomposable hypergraphs
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Compositions of Graphs and Polyhedra IV: Acyclic Spanning Subgraphs
• Critical facets of the stable set polytope
• Determining the automorphism group of the linear ordering polytope
• Facets and lifting procedures for the set covering polytope
• Facets of the linear ordering polytope
• Facets of the linear ordering polytope: a unification for the fence family through weighted graphs
• Geometric and combinatorial properties of the polytope of binary choice probabilities
• Induced binary probabilities and the linear ordering polytope: A status report
• Lectures on Polytopes
• Lower bound for the maximal number of facets of a 0/1 polytope
• Matching theory
• More facets from fences for linear ordering and acyclic subgraph polytopes
• New Facets of the Linear Ordering Polytope
• On 0-1 polytopes with many facets
• On a family of line-critical graphs
• On certain polytopes associated with graphs
• On the acyclic subgraph polytope
• On the facial structure of the set covering polytope
• On the monotonization of polyhedra
• On the set covering polytope. I: All the facets with coefficients in \(\{\) 0,1,2\(\}\)
• 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
• The complexity of facets (and some facets of complexity)
• The complexity of facets resolved
• The ellipsoid method and its consequences in combinatorial optimization
• The strongest facets of the acyclic subgraph polytope are unknown

Cited in

(7)

• Extended formulations for order polytopes through network flows
• Boolean quadric polytopes are faces of linear ordering polytopes
• Primary facets of order polytopes
• Weighted graphs defining facets: A connection between stable set and linear ordering polytopes
• 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
• A survey on the linear ordering problem for weighted or unweighted tournaments

Describes a project that uses

Uses Software

• LOLIB

This page was built for publication: How to recycle your facets

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