scientific article; zbMATH DE number 764212

MaRDI QIDQ4836157zbMATH OpenFDO

Authors François Margot

Publication date 14 June 1995

zbMATH Keywords

integrality proofspolyhedral characterization of Steiner's problempolyhedral combinatorics

Mathematics Subject Classification ID

Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Combinatorial optimization (90C27)

Recommendations

• scientific article; zbMATH DE number 863499
• Polyhedral Combinatorics in Combinatorial Optimization
• scientific article; zbMATH DE number 16720
• Compositions of Graphs and Polyhedra I: Balanced Induced Subgraphs and Acyclic Subgraphs
• Polyhedral proof methods in combinatorial optimization

Cited in

(10)

• One-node cutsets and the dominating set polytope
• On decomposability of multilinear sets
• Composition of graphs and the triangle-free subgraph polytope
• Recognizing Cartesian products of matrices and polytopes
• 2-clique-bond of stable set polyhedra
• The projected faces property and polyhedral relations
• scientific article; zbMATH DE number 16720 (Why is no real title available?)
• On permuting some coordinates of polytopes
• Slack matrices, k-products, and 2-level polytopes
• Extension complexity of formal languages

This page was built for publication:

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