Network design for time-constrained delivery using subgraphs (Q395697): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10287-012-0154-2
+Normal rank
@@ Property / OpenAlex ID @@
+W2029261049
@@ Property / OpenAlex ID: W2029261049 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2721331
@@ Property / cites work: Q2721331 / rank @@
+Normal rank
@@ Property / cites work @@
+Network design for time‐constrained delivery
@@ Property / cites work: Network design for time‐constrained delivery / rank @@
+Normal rank
@@ Property / cites work @@
+Minimax flow tree problems
@@ Property / cites work: Minimax flow tree problems / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of the network design problem
@@ Property / cites work: The complexity of the network design problem / rank @@
+Normal rank
@@ Property / cites work @@
+On the minimum-cardinality-bounded-diameter and the bounded-cardinality- minimum-diameter edge addition problems
+Normal rank
@@ Property / cites work @@
+The complexity of designing a network with minimum diameter
+Normal rank
@@ Property / cites work @@
+On the sum of all distances in a graph or digraph
@@ Property / cites work: On the sum of all distances in a graph or digraph / rank @@
+Normal rank
@@ Property / cites work @@
+Light graphs with small routing cost
@@ Property / cites work: Light graphs with small routing cost / rank @@
+Normal rank