Paths, trees and matchings under disjunctive constraints (Q643009): Difference between revisions

@@ Property / cites work @@
+Q4258216
@@ Property / cites work: Q4258216 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4260373
@@ Property / cites work: Q4260373 / rank @@
+Normal rank
@@ Property / cites work @@
+Determining a Minimum Spanning Tree with Disjunctive Constraints
+Normal rank
@@ Property / cites work @@
+Matroid Intersection
@@ Property / cites work: Matroid Intersection / rank @@
+Normal rank
@@ Property / cites work @@
+An approximation scheme for bin packing with conflicts
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for time constrained scheduling
+Normal rank
@@ Property / cites work @@
+Q4764626
@@ Property / cites work: Q4764626 / rank @@
+Normal rank
@@ Property / cites work @@
+The Knapsack Problem with Conflict Graphs
@@ Property / cites work: The Knapsack Problem with Conflict Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The maximum flow problem with disjunctive constraints
+Normal rank
@@ Property / cites work @@
+Combinatorial optimization. Polyhedra and efficiency (3 volumes)
+Normal rank
@@ Property / cites work @@
+Q4111952
@@ Property / cites work: Q4111952 / rank @@
+Normal rank