On finding the K best cuts in a network (Q792224): Difference between revisions

@@ Property / reviewed by @@
+M. A. Frumkin
@@ Property / reviewed by: M. A. Frumkin / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+An O(K.n**4) algorithm for finding the K best cuts in a network
+Normal rank
@@ Property / cites work @@
+Q3683848
@@ Property / cites work: Q3683848 / rank @@
+Normal rank
@@ Property / cites work @@
+Some Network Flow Problems Solved with Pseudo-Boolean Programming
+Normal rank
@@ Property / cites work @@
+Q4130999
@@ Property / cites work: Q4130999 / rank @@
+Normal rank
@@ Property / cites work @@
+Letter to the Editor—An Algorithm for Ranking all the Assignments in Order of Increasing Cost
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0167-6377(84)90083-x
+Normal rank
@@ Property / OpenAlex ID @@
+W2071110640
@@ Property / OpenAlex ID: W2071110640 / rank @@
+Normal rank