Unbounded knapsack problems with arithmetic weight sequences (Q545110): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ejor.2011.03.028
+Normal rank
@@ Property / OpenAlex ID @@
+W2090987741
@@ Property / OpenAlex ID: W2090987741 / rank @@
+Normal rank
@@ Property / cites work @@
+A linear algorithm for integer programming in the plane
+Normal rank
@@ Property / cites work @@
+On linear forms whose coefficients are in arithmetic progression
+Normal rank
@@ Property / cites work @@
+A Polynomial-Time Algorithm for the Knapsack Problem with Two Variables
+Normal rank
@@ Property / cites work @@
+Integer Programming with a Fixed Number of Variables
+Normal rank
@@ Property / cites work @@
+When the Greedy Solution Solves a Class of Knapsack Problems
+Normal rank
@@ Property / cites work @@
+Q3993418
@@ Property / cites work: Q3993418 / rank @@
+Normal rank
@@ Property / cites work @@
+A new lower bound for the linear knapsack problem with general integer variables
+Normal rank
@@ Property / cites work @@
+On variations of the subset sum problem
@@ Property / cites work: On variations of the subset sum problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q3818127
@@ Property / cites work: Q3818127 / rank @@
+Normal rank
@@ Property / cites work @@
+A polynomially solvable special case of the unbounded knapsack problem
+Normal rank