A further study on inverse linear programming problems (Q1298792): Difference between revisions

@@ Property / cites work @@
+Improving the location of minisum facilities through network modification
+Normal rank
@@ Property / cites work @@
+Improving the location of minimax facilities through network modification
+Normal rank
@@ Property / cites work @@
+Q4363164
@@ Property / cites work: Q4363164 / rank @@
+Normal rank
@@ Property / cites work @@
+On an instance of the inverse shortest paths problem
+Normal rank
@@ Property / cites work @@
+On the use of an inverse shortest paths algorithm for recovering linearly correlated costs
+Normal rank
@@ Property / cites work @@
+Inverse matroid intersection problem
@@ Property / cites work: Inverse matroid intersection problem / rank @@
+Normal rank
@@ Property / cites work @@
+An inverse DEA model for inputs/outputs estimate
@@ Property / cites work: An inverse DEA model for inputs/outputs estimate / rank @@
+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 maximum capacity problems
@@ Property / cites work: Inverse maximum capacity problems / rank @@
+Normal rank
@@ Property / cites work @@
+Calculating some inverse linear programming problems
+Normal rank
@@ Property / cites work @@
+A network flow method for solving some inverse combinatorial optimization problems
+Normal rank