A branch and bound algorithm for the robust spanning tree problem with interval data (Q706974): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ejor.2003.10.008
+Normal rank
@@ Property / OpenAlex ID @@
+W1971456873
@@ Property / OpenAlex ID: W1971456873 / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of the robust spanning tree problem with interval data
+Normal rank
@@ Property / cites work @@
+Two Algorithms for Generating Weighted Spanning Trees in Order
+Normal rank
@@ Property / cites work @@
+Robust discrete optimization and its applications
@@ Property / cites work: Robust discrete optimization and its applications / rank @@
+Normal rank
@@ Property / cites work @@
+Q4851642
@@ Property / cites work: Q4851642 / rank @@
+Normal rank
@@ Property / cites work @@
+On the shortest spanning subtree of a graph and the traveling salesman problem
+Normal rank
@@ Property / cites work @@
+A branch and bound algorithm for the robust shortest path problem with interval data.
+Normal rank
@@ Property / cites work @@
+The robust spanning tree problem with interval data
+Normal rank