An algorithm for solving the shortest path improvement problem on rooted trees under unit Hamming distance (Q1670106): Difference between revisions

@@ Property / DOI @@
-.1007/s10957-018-1221-9
@@ Property / DOI: 10.1007/s10957-018-1221-9 / rank @@
-Normal rank
@@ Property / cites work @@
+Inverse combinatorial optimization: a survey on problems, methods, and results
+Normal rank
@@ Property / cites work @@
+On an instance of the inverse shortest paths problem
+Normal rank
@@ Property / cites work @@
+A column generation method for inverse shortest path problems
+Normal rank
@@ Property / cites work @@
+Computation of the reverse shortest-path problem
@@ Property / cites work: Computation of the reverse shortest-path problem / rank @@
+Normal rank
@@ Property / cites work @@
+Weighted inverse minimum spanning tree problems under Hamming distance
+Normal rank
@@ Property / cites work @@
+Some inverse optimization problems under the Hamming distance
+Normal rank
@@ Property / cites work @@
+Inverse 1-median problem on trees under weighted Hamming distance
+Normal rank
@@ Property / cites work @@
+Inverse max + sum spanning tree problem under Hamming distance by modifying the sum-cost vector
+Normal rank
@@ Property / cites work @@
+Inverse minimum cost flow problems under the weighted Hamming distance
+Normal rank
@@ Property / cites work @@
+Inverse min-max spanning tree problem under the weighted sum-type Hamming distance
+Normal rank
@@ Property / cites work @@
+The center location improvement problem under the 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 shortest path improvement problems under Hamming distance
+Normal rank
@@ Property / cites work @@
+Q3466912
@@ Property / cites work: Q3466912 / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/S10957-018-1221-9
@@ Property / DOI: 10.1007/S10957-018-1221-9 / rank @@
+Normal rank