Robust partial inverse network flow problems (Q5943384): Difference between revisions

@@ Property / DOI @@
-.1007/s11766-001-0026-y
@@ Property / DOI: 10.1007/s11766-001-0026-y / rank @@
-Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s11766-001-0026-y
+Normal rank
@@ Property / OpenAlex ID @@
+W2325838670
@@ Property / OpenAlex ID: W2325838670 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3056948
@@ Property / cites work: Q3056948 / rank @@
+Normal rank
@@ Property / cites work @@
+On an instance of the inverse shortest paths problem
+Normal rank
@@ Property / cites work @@
+Inverse polymatroidal flow problem
@@ Property / cites work: Inverse polymatroidal flow problem / rank @@
+Normal rank
@@ Property / cites work @@
+Inverse problems of submodular functions on digraphs
+Normal rank
@@ Property / cites work @@
+Q3048571
@@ Property / cites work: Q3048571 / rank @@
+Normal rank
@@ Property / cites work @@
+A strongly polynomial minimum cost circulation algorithm
+Normal rank
@@ Property / cites work @@
+A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
+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 @@
+Inverse problem of minimum cuts
@@ Property / cites work: Inverse problem of minimum cuts / rank @@
+Normal rank
@@ Property / cites work @@
+An algorithm for inverse minimum spanning tree problem
+Normal rank
@@ Property / DOI @@
+.1007/S11766-001-0026-Y
@@ Property / DOI: 10.1007/S11766-001-0026-Y / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:5943384