A well-solvable special case of the bounded knapsack problem (Q2275577): Difference between revisions

@@ Property / author @@
-Vladimir G. Deǐneko
@@ Property / author: Vladimir G. Deǐneko / rank @@
-Normal rank
@@ Property / author @@
-Gerhard J. Woeginger
@@ Property / author: Gerhard J. Woeginger / rank @@
-Normal rank
@@ Property / author @@
+Vladimir G. Deǐneko
@@ Property / author: Vladimir G. Deǐneko / rank @@
+Normal rank
@@ Property / author @@
+Gerhard J. Woeginger
@@ Property / author: Gerhard J. Woeginger / rank @@
+Normal rank
@@ 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.2011.01.006
+Normal rank
@@ Property / OpenAlex ID @@
+W2131397354
@@ Property / OpenAlex ID: W2131397354 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4142699
@@ Property / cites work: Q4142699 / rank @@
+Normal rank
@@ Property / cites work @@
+The cutting stock problem and integer rounding
@@ Property / cites work: The cutting stock problem and integer rounding / rank @@
+Normal rank
@@ Property / cites work @@
+Q3993418
@@ Property / cites work: Q3993418 / rank @@
+Normal rank
@@ Property / cites work @@
+Integer knapsack and flow covers with divisible coefficients: Polyhedra, optimization and separation
+Normal rank
@@ Property / cites work @@
+A polynomial-time algorithm for knapsack with divisible item sizes
+Normal rank
@@ Property / cites work @@
+A polynomially solvable special case of the unbounded knapsack problem
+Normal rank