Weighted inverse minimum spanning tree problems under Hamming distance (Q1774530): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10878-005-5486-1
+Normal rank
@@ Property / OpenAlex ID @@
+W2044926776
@@ Property / OpenAlex ID: W2044926776 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3056948
@@ Property / cites work: Q3056948 / rank @@
+Normal rank
@@ Property / cites work @@
+A Faster Algorithm for the Inverse Spanning Tree Problem
+Normal rank
@@ Property / cites work @@
+Inverse combinatorial optimization: a survey on problems, methods, and results
+Normal rank
@@ Property / cites work @@
+Solving Inverse Spanning Tree Problems Through Network Flow Techniques
+Normal rank
@@ Property / cites work @@
+A general model of some inverse combinatorial optimization problems and its solution method under \(\ell_\infty\) norm
+Normal rank
@@ Property / cites work @@
+Q4716335
@@ Property / cites work: Q4716335 / rank @@
+Normal rank
@@ Property / cites work @@
+Solution structure of some inverse combinatorial optimization problems
+Normal rank
@@ Property / cites work @@
+An algorithm for inverse minimum spanning tree problem
+Normal rank