On the linear relaxation of the 2-node connected subgraph polytope

DOI10.1016/S0166-218X(99)00088-8MaRDI QIDQ1302172zbMATH OpenOpenAlexWikidataFDO

Authors C. Nocq, A. R. Mahjoub

Publication date 22 September 1999

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0166-218x(99)00088-8

zbMATH Keywords

2-node connected subgraph polytopeextreme pointpolytope

Mathematics Subject Classification ID

Graph theory (05C99)

Recommendations

• Critical extreme points of the 2-edge connected spanning subgraph polytope
• The \(k\)-edge connected subgraph problem. I: Polytopes and critical extreme points.
• scientific article; zbMATH DE number 1342128
• The node-edge weighted 2-edge connected subgraph problem: linear relaxation, facets and separation
• On two-connected subgraph polytopes

Cited in

(9)

• The node-edge weighted 2-edge connected subgraph problem: linear relaxation, facets and separation
• Critical extreme points of the 2-edge connected spanning subgraph polytope
• On the facets of the lift-and-project relaxations of graph subdivisions
• The k-node connected subgraph problem: polyhedral analysis and branch-and-cut
• scientific article; zbMATH DE number 1342128 (Why is no real title available?)
• Polytopes and connected subgraphs
• Design of survivable networks with low connectivity requirements
• Extended formulation and branch-and-cut-and-price algorithm for the two connected subgraph problem with disjunctive constraints
• Half integer extreme points in the linear relaxation of the 2-edge-connected subgraph polyhedron

This page was built for publication: On the linear relaxation of the 2-node connected subgraph polytope

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