Improved compact formulations for metric and cut polyhedra (Q325413): Difference between revisions

@@ Property / DOI @@
-.1016/j.endm.2016.03.017
@@ Property / DOI: 10.1016/j.endm.2016.03.017 / rank @@
-Normal rank
@@ Property / author @@
-Dang-Phuong-Lan Nguyen
@@ Property / author: Dang-Phuong-Lan Nguyen / rank @@
-Normal rank
@@ Property / author @@
+Dang-Phuong-Lan Nguyen
@@ Property / author: Dang-Phuong-Lan Nguyen / 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.1016/j.endm.2016.03.017
+Normal rank
@@ Property / OpenAlex ID @@
+W2398343076
@@ Property / OpenAlex ID: W2398343076 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4735936
@@ Property / cites work: Q4735936 / rank @@
+Normal rank
@@ Property / cites work @@
+On cuts and matchings in planar graphs
@@ Property / cites work: On cuts and matchings in planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On the cut polytope
@@ Property / cites work: On the cut polytope / rank @@
+Normal rank
@@ Property / cites work @@
+Extended formulations in combinatorial optimization
+Normal rank
@@ Property / cites work @@
+Application of cut polyhedra. I
@@ Property / cites work: Application of cut polyhedra. I / rank @@
+Normal rank
@@ Property / cites work @@
+Applications of cut polyhedra. II
@@ Property / cites work: Applications of cut polyhedra. II / rank @@
+Normal rank
@@ Property / cites work @@
+An effective compact formulation of the max cut problem on sparse graphs
+Normal rank
@@ Property / DOI @@
+.1016/J.ENDM.2016.03.017
@@ Property / DOI: 10.1016/J.ENDM.2016.03.017 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:325413