The base-matroid and inverse combinatorial optimization problems. (Q1811117): Difference between revisions

@@ Property / cites work @@
+Inverse Optimization
@@ Property / cites work: Inverse Optimization / rank @@
+Normal rank
@@ Property / cites work @@
+Solving Inverse Spanning Tree Problems Through Network Flow Techniques
+Normal rank
@@ Property / cites work @@
+On an instance of the inverse shortest paths problem
+Normal rank
@@ Property / cites work @@
+Inverse problems of matroid intersection
@@ Property / cites work: Inverse problems of matroid intersection / rank @@
+Normal rank
@@ Property / cites work @@
+Inverse matroid intersection problem
@@ Property / cites work: Inverse matroid intersection problem / rank @@
+Normal rank
@@ Property / cites work @@
+Inverse polymatroidal flow problem
@@ Property / cites work: Inverse polymatroidal flow problem / rank @@
+Normal rank
@@ Property / cites work @@
+On submodular function minimization
@@ Property / cites work: On submodular function minimization / rank @@
+Normal rank
@@ Property / cites work @@
+Transversals and matroid partition
@@ Property / cites work: Transversals and matroid partition / rank @@
+Normal rank
@@ Property / cites work @@
+A weighted matroid intersection algorithm
@@ Property / cites work: A weighted matroid intersection algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+A strongly polynomial algorithm for the inverse shortest arborescence problem
+Normal rank
@@ Property / cites work @@
+Q4130999
@@ Property / cites work: Q4130999 / rank @@
+Normal rank
@@ Property / cites work @@
+Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
+Normal rank
@@ Property / cites work @@
+Q3135082
@@ Property / cites work: Q3135082 / rank @@
+Normal rank