The node-edge weighted 2-edge connected subgraph problem: linear relaxation, facets and separation (Q2506819): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q65553924
@@ Property / Wikidata QID: Q65553924 / rank @@
+Normal rank
@@ Property / cites work @@
+Steiner 2-Edge Connected Subgraph Polytopes on Series-Parallel Graphs
+Normal rank
@@ Property / cites work @@
+On two-connected subgraph polytopes
@@ Property / cites work: On two-connected subgraph polytopes / rank @@
+Normal rank
@@ Property / cites work @@
+A note on the prize collecting traveling salesman problem
+Normal rank
@@ Property / cites work @@
+The ellipsoid method and its consequences in combinatorial optimization
+Normal rank
@@ Property / cites work @@
+Integer Polyhedra Arising from Certain Network Design Problems with Connectivity Constraints
+Normal rank
@@ Property / cites work @@
+The Steiner tree polytope and related polyhedra
@@ Property / cites work: The Steiner tree polytope and related polyhedra / rank @@
+Normal rank
@@ Property / cites work @@
+Two-edge connected spanning subgraphs and polyhedra
+Normal rank
@@ Property / cites work @@
+Minimum-weight two-connected spanning networks
@@ Property / cites work: Minimum-weight two-connected spanning networks / rank @@
+Normal rank
@@ Property / cites work @@
+Design of survivable networks
@@ Property / cites work: Design of survivable networks / rank @@
+Normal rank
@@ Property / cites work @@
+Generalized steiner problem in series-parallel networks
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2506819