A branch and bound algorithm for the acyclic subgraph problem (Q1154950): Difference between revisions

@@ Property / cites work @@
+Q4773298
@@ Property / cites work: Q4773298 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5329508
@@ Property / cites work: Q5329508 / rank @@
+Normal rank
@@ Property / cites work @@
+Maximum likelihood paired comparison ranking by linear programming
+Normal rank
@@ Property / cites work @@
+A branch and bound algorithm for maximum likelihood paired comparison ranking
+Normal rank
@@ Property / cites work @@
+Q4178782
@@ Property / cites work: Q4178782 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem
+Normal rank
@@ Property / cites work @@
+Q4142699
@@ Property / cites work: Q4142699 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4197641
@@ Property / cites work: Q4197641 / rank @@
+Normal rank
@@ Property / cites work @@
+Zwei Algorithmen zur Lösung eines komplexen Reihenfolgeproblems
+Normal rank
@@ Property / cites work @@
+Q4060764
@@ Property / cites work: Q4060764 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4194705
@@ Property / cites work: Q4194705 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5585195
@@ Property / cites work: Q5585195 / rank @@
+Normal rank
@@ Property / cites work @@
+A Consistent Extension of Condorcet’s Election Principle
+Normal rank