Testing integer knapsacks for feasibility (Q1266633): 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(94)00214-2
+Normal rank
@@ Property / OpenAlex ID @@
+W2076444930
@@ Property / OpenAlex ID: W2076444930 / rank @@
+Normal rank
@@ Property / cites work @@
+A New Knapsack Solution Approach by Integer Equivalent Aggregation and Consistency Determination
+Normal rank
@@ Property / cites work @@
+Q3241581
@@ Property / cites work: Q3241581 / rank @@
+Normal rank
@@ Property / cites work @@
+On a Problem of Partitions
@@ Property / cites work: On a Problem of Partitions / rank @@
+Normal rank
@@ Property / cites work @@
+Shortest-Route Methods: 2. Group Knapsacks, Expanded Networks, and Branch-and-Bound
+Normal rank
@@ Property / cites work @@
+Integer Programming over a Finite Additive Group
@@ Property / cites work: Integer Programming over a Finite Additive Group / rank @@
+Normal rank
@@ Property / cites work @@
+On the asymptotic integer algorithm
@@ Property / cites work: On the asymptotic integer algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+The structure of an integral monoid and integer programming feasibility
+Normal rank
@@ Property / cites work @@
+Dynamic Programming Algorithms for the Integer Programming Problem—I: The Integer Programming Problem Viewed as a Knapsack Type Problem
+Normal rank