A branch and bound algorithm for the robust shortest path problem with interval data. (Q1426725): Difference between revisions

@@ Property / DOI @@
-.1016/j.orl.2003.08.002
@@ Property / DOI: 10.1016/j.orl.2003.08.002 / rank @@
-Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.orl.2003.08.002
+Normal rank
@@ Property / OpenAlex ID @@
+W2103776399
@@ Property / OpenAlex ID: W2103776399 / rank @@
+Normal rank
@@ Property / cites work @@
+Shortest path problems with partial information: Models and algorithms for detecting dominance
+Normal rank
@@ Property / cites work @@
+A note on two problems in connexion with graphs
@@ Property / cites work: A note on two problems in connexion with graphs / rank @@
+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 @@
+An exact 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
@@ Property / cites work @@
+On the robust shortest path problem.
@@ Property / cites work: On the robust shortest path problem. / rank @@
+Normal rank
@@ Property / cites work @@
+The computational complexity of the relative robust shortest path problem with interval data
+Normal rank
@@ Property / DOI @@
+.1016/J.ORL.2003.08.002
@@ Property / DOI: 10.1016/J.ORL.2003.08.002 / rank @@
+Normal rank