The 2-edge-connected subgraph polyhedron (Q2576774): Difference between revisions

@@ Property / author @@
-Nemhauser, George I.
@@ Property / author: Nemhauser, George I. / rank @@
-Normal rank
@@ Property / author @@
+Nemhauser, George I.
@@ Property / author: Nemhauser, George I. / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+Concorde
@@ Property / describes a project that uses: Concorde / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+PORTA
@@ Property / describes a project that uses: PORTA / rank @@
+Normal rank
@@ 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.1007/s10878-005-1777-9
+Normal rank
@@ Property / OpenAlex ID @@
+W1986525787
@@ Property / OpenAlex ID: W1986525787 / rank @@
+Normal rank
@@ Property / cites work @@
+On two-connected subgraph polytopes
@@ Property / cites work: On two-connected subgraph polytopes / rank @@
+Normal rank
@@ Property / cites work @@
+Small Travelling Salesman Polytopes
@@ Property / cites work: Small Travelling Salesman Polytopes / rank @@
+Normal rank
@@ Property / cites work @@
+An Integer Polytope Related to the Design of Survivable Communication Networks
+Normal rank
@@ Property / cites work @@
+Minimally 2-edge connected graphs
@@ Property / cites work: Minimally 2-edge connected graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The <i>k</i>-Edge-Connected Spanning Subgraph Polyhedron
+Normal rank
@@ Property / cites work @@
+The traveling salesman problem on a graph and some related integer polyhedra
+Normal rank
@@ Property / cites work @@
+Q4263710
@@ Property / cites work: Q4263710 / rank @@
+Normal rank
@@ Property / cites work @@
+The traveling salesman problem in graphs with some excluded minors
+Normal rank
@@ Property / cites work @@
+On the symmetric travelling salesman problem I: Inequalities
+Normal rank
@@ Property / cites work @@
+Clique Tree Inequalities and the Symmetric Travelling Salesman Problem
+Normal rank
@@ Property / cites work @@
+Q4845372
@@ Property / cites work: Q4845372 / rank @@
+Normal rank
@@ Property / cites work @@
+Two-edge connected spanning subgraphs and polyhedra
+Normal rank
@@ Property / cites work @@
+On perfectly two-edge connected graphs
@@ Property / cites work: On perfectly two-edge connected graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The Binested Inequalities for the Symmetric Traveling Salesman Polytope
+Normal rank
@@ Property / cites work @@
+The graphical relaxation: A new framework for the symmetric traveling salesman polytope
+Normal rank
@@ Property / cites work @@
+Efficient separation routines for the symmetric traveling salesman problem. I: General tools and comb separation
+Normal rank
@@ Property / cites work @@
+Efficient separation routines for the symmetric traveling salesman problem. II: Separating multi handle inequalities.
+Normal rank