Polytopes and connected subgraphs

zbMATH Open1324.90137MaRDI QIDQ5264743FDOQ5264743

A. V. Seliverstov

Publication date: 27 July 2015

Full work available at URL: http://mathnet.ru/eng/da778

Recommendations

• The Boolean quadratic polytope: Some characteristics, facets and relatives
• scientific article
• On the linear relaxation of the 2-node connected subgraph polytope
• The \(k\)-edge connected subgraph problem. I: Polytopes and critical extreme points.
• Polyhedral study of the connected subgraph problem

zbMATH Keywords

combinatorial optimizationpolytopepolyhedral conesubgraph

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Cited In (4)

• On the polytope faces of the graph approximation problem
• Polyhedra of the Equivalent Subgraph Problem and Some Edge Connectivity Problems
• Linkages in Polytope Graphs
• Polyhedral study of the connected subgraph problem

This page was built for publication: Polytopes and connected subgraphs

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