Inverse min-max spanning tree problem under the weighted sum-type Hamming distance (Q924129): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2007.12.006
+Normal rank
@@ Property / OpenAlex ID @@
+W2129343799
@@ Property / OpenAlex ID: W2129343799 / rank @@
+Normal rank
@@ Property / cites work @@
+The Min-Max Spanning Tree Problem and some extensions
+Normal rank
@@ Property / cites work @@
+Some inverse min-max network problems under weighted \(l_1\) ans \(l_{\infty}\) norms with bound constraints on changes
+Normal rank
@@ Property / cites work @@
+Inverse combinatorial optimization: a survey on problems, methods, and results
+Normal rank
@@ Property / cites work @@
+Weighted inverse minimum spanning tree problems under Hamming distance
+Normal rank
@@ Property / cites work @@
+Constrained inverse minimum spanning tree problems under the bottleneck-type Hamming distance
+Normal rank
@@ Property / cites work @@
+The center location improvement problem under the Hamming distance
+Normal rank
@@ Property / cites work @@
+Computing and Combinatorics
@@ Property / cites work: Computing and Combinatorics / rank @@
+Normal rank
@@ Property / cites work @@
+Inverse maximum flow problems under the weighted Hamming distance
+Normal rank
@@ Property / cites work @@
+A WEIGHTED INVERSE MINIMUM CUT PROBLEM UNDER THE BOTTLENECK TYPE HAMMING DISTANCE
+Normal rank
@@ Property / cites work @@
+Q3056948
@@ Property / cites work: Q3056948 / rank @@
+Normal rank