Minimum spanning tree with conflicting edge pairs: a branch-and-cut approach (Q829168): Difference between revisions

@@ Property / DOI @@
-.1007/s10479-018-2895-y
@@ Property / DOI: 10.1007/s10479-018-2895-y / 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/s10479-018-2895-y
+Normal rank
@@ Property / OpenAlex ID @@
+W2806852865
@@ Property / OpenAlex ID: W2806852865 / rank @@
+Normal rank
@@ Property / cites work @@
+Determining a Minimum Spanning Tree with Disjunctive Constraints
+Normal rank
@@ Property / cites work @@
+Paths, trees and matchings under disjunctive constraints
+Normal rank
@@ Property / cites work @@
+Matrices with the Edmonds-Johnson property
@@ Property / cites work: Matrices with the Edmonds-Johnson property / rank @@
+Normal rank
@@ Property / cites work @@
+The minimum cost perfect matching problem with conflict pair constraints
+Normal rank
@@ Property / cites work @@
+Trees and Cuts
@@ Property / cites work: Trees and Cuts / rank @@
+Normal rank
@@ Property / cites work @@
+The Knapsack Problem with Conflict Graphs
@@ Property / cites work: The Knapsack Problem with Conflict Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The maximum flow problem with disjunctive constraints
+Normal rank
@@ Property / cites work @@
+A branch and cut algorithm for minimum spanning trees under conflict constraints
+Normal rank
@@ Property / cites work @@
+The minimum spanning tree problem with conflict constraints and its variations
+Normal rank
@@ Property / DOI @@
+.1007/S10479-018-2895-Y
@@ Property / DOI: 10.1007/S10479-018-2895-Y / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q129760222
@@ Property / Wikidata QID: Q129760222 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:829168