The tree-star problem: a formulation and a branch-and-cut algorithm (Q325465): Difference between revisions

@@ Property / DOI @@
-.1016/j.endm.2016.03.038
@@ Property / DOI: 10.1016/j.endm.2016.03.038 / rank @@
-Normal rank
@@ Property / describes a project that uses @@
+TSPLIB
@@ Property / describes a project that uses: TSPLIB / 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.038
+Normal rank
@@ Property / OpenAlex ID @@
+W2408068853
@@ Property / OpenAlex ID: W2408068853 / rank @@
+Normal rank
@@ Property / cites work @@
+On the shortest spanning subtree of a graph and the traveling salesman problem
+Normal rank
@@ Property / cites work @@
+The Ring Star Problem: Polyhedral analysis and exact algorithm
+Normal rank
@@ Property / cites work @@
+Reformulations and solution algorithms for the maximum leaf spanning tree problem
+Normal rank
@@ Property / cites work @@
+Strong lower bounds for the prize collecting Steiner problem in graphs
+Normal rank
@@ Property / cites work @@
+The Minimum Connected Dominating Set Problem: Formulation, Valid Inequalities and a Branch-and-Cut Algorithm
+Normal rank
@@ Property / cites work @@
+The ring-star problem: a new integer programming formulation and a branch-and-cut algorithm
+Normal rank
@@ Property / DOI @@
+.1016/J.ENDM.2016.03.038
@@ Property / DOI: 10.1016/J.ENDM.2016.03.038 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:325465