Threshold arrangements and the knapsack problem (Q812753): 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.aml.2005.03.010
+Normal rank
@@ Property / OpenAlex ID @@
+W2074117568
@@ Property / OpenAlex ID: W2074117568 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Heuristic algorithms for the multiple knapsack problem
+Normal rank
@@ Property / cites work @@
+An alternative to Ben-Or's lower bound for the knapsack problem complexity
+Normal rank
@@ Property / cites work @@
+Q4331740
@@ Property / cites work: Q4331740 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4236280
@@ Property / cites work: Q4236280 / rank @@
+Normal rank
@@ Property / cites work @@
+Threshold graphs and related topics
@@ Property / cites work: Threshold graphs and related topics / rank @@
+Normal rank