Inverse maximum flow problems under the weighted Hamming distance (Q2385473): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10878-006-9006-8
+Normal rank
@@ Property / OpenAlex ID @@
+W2018562299
@@ Property / OpenAlex ID: W2018562299 / rank @@
+Normal rank
@@ Property / cites work @@
+Some inverse optimization problems under the Hamming distance
+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 @@
+Inverse combinatorial optimization: a survey on problems, methods, and results
+Normal rank
@@ Property / cites work @@
+Combinatorial optimization. Polyhedra and efficiency (3 volumes)
+Normal rank
@@ Property / cites work @@
+Inverse maximum flow and minimum cut problems
@@ Property / cites work: Inverse maximum flow and minimum cut problems / rank @@
+Normal rank
@@ Property / cites work @@
+Computing and Combinatorics
@@ Property / cites work: Computing and Combinatorics / rank @@
+Normal rank
@@ Property / cites work @@
+The center location improvement problem under the Hamming distance
+Normal rank