Cost-effective allocations of bounded and binary resources in polynomial time (Q1168898): 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/0377-2217(82)90112-6
+Normal rank
@@ Property / OpenAlex ID @@
+W2026717830
@@ Property / OpenAlex ID: W2026717830 / rank @@
+Normal rank
@@ Property / cites work @@
+Fractional Programming with Homogeneous Functions
@@ Property / cites work: Fractional Programming with Homogeneous Functions / rank @@
+Normal rank
@@ Property / cites work @@
+Programming with linear fractional functionals
@@ Property / cites work: Programming with linear fractional functionals / rank @@
+Normal rank
@@ Property / cites work @@
+Q3844775
@@ Property / cites work: Q3844775 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3292914
@@ Property / cites work: Q3292914 / rank @@
+Normal rank
@@ Property / cites work @@
+Implementation and computational comparisons of primal, dual and primal-dual computer codes for minimum cost network flow problems
+Normal rank
@@ Property / cites work @@
+Q3318566
@@ Property / cites work: Q3318566 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4197641
@@ Property / cites work: Q4197641 / rank @@
+Normal rank
@@ Property / cites work @@
+On Fulkerson's Conjecture About Consistent Labeling Processes
+Normal rank
@@ Property / cites work @@
+Location of a discrete resource and its allocation according to a fractional objective
+Normal rank
@@ Property / cites work @@
+Bounded Allocations of Discrete and Binary Resources
+Normal rank
@@ Property / cites work @@
+Parameter-free convex equivalent and dual programs of fractional programming problems
+Normal rank