The \(k\)-node connected subgraph problem: polyhedral analysis and branch-and-cut (Q325409): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.endm.2016.03.016
+Normal rank
@@ Property / OpenAlex ID @@
+W2404189039
@@ Property / OpenAlex ID: W2404189039 / rank @@
+Normal rank
@@ Property / cites work @@
+A branch-and-cut algorithm for the k-edge connected subgraph problem
+Normal rank
@@ Property / cites work @@
+The <i>k</i>-Edge-Connected Spanning Subgraph Polyhedron
+Normal rank
@@ Property / cites work @@
+\(k\)-edge connected polyhedra on series-parallel graphs
+Normal rank
@@ Property / cites work @@
+The \(k\)-edge connected subgraph problem. I: Polytopes and critical extreme points.
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4035361
@@ Property / cites work: Q4035361 / rank @@
+Normal rank
@@ Property / cites work @@
+On the linear relaxation of the 2-node connected subgraph polytope
+Normal rank