Complexity, algorithms and applications of the integer network flow with fractional supplies problem (Q2060603): 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/j.orl.2021.06.003
+Normal rank
@@ Property / OpenAlex ID @@
+W3168519844
@@ Property / OpenAlex ID: W3168519844 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3056948
@@ Property / cites work: Q3056948 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4395423
@@ Property / cites work: Q4395423 / rank @@
+Normal rank
@@ Property / cites work @@
+Reducibility among Combinatorial Problems
@@ Property / cites work: Reducibility among Combinatorial Problems / rank @@
+Normal rank
@@ Property / cites work @@
+A Faster Strongly Polynomial Minimum Cost Flow Algorithm
+Normal rank
@@ Property / cites work @@
+Using Mixed Integer Programming for Matching in an Observational Study of Kidney Failure After Surgery
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2060603