Blocking pairs of polyhedra arising from network flows (Q1221561): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0095-8956(75)90052-0
+Normal rank
@@ Property / OpenAlex ID @@
+W2025941642
@@ Property / OpenAlex ID: W2025941642 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3292914
@@ Property / cites work: Q3292914 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5620998
@@ Property / cites work: Q5620998 / rank @@
+Normal rank
@@ Property / cites work @@
+Anti-blocking polyhedra
@@ Property / cites work: Anti-blocking polyhedra / rank @@
+Normal rank
@@ Property / cites work @@
+Blocking and anti-blocking pairs of polyhedra
@@ Property / cites work: Blocking and anti-blocking pairs of polyhedra / rank @@
+Normal rank
@@ Property / cites work @@
+Packing rooted directed cuts in a weighted directed graph
+Normal rank
@@ Property / cites work @@
+A theorem on flows in networks
@@ Property / cites work: A theorem on flows in networks / rank @@
+Normal rank
@@ Property / cites work @@
+Extremal configurations and decomposition theorems. I
+Normal rank
@@ Property / cites work @@
+Q3851094
@@ Property / cites work: Q3851094 / rank @@
+Normal rank
@@ Property / cites work @@
+On a Class of Capacitated Transportation Problems
@@ Property / cites work: On a Class of Capacitated Transportation Problems / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1221561