An approximate binary search algorithm for the multiple-choice knapsack problem (Q293371): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3050129
@@ Property / cites work: Q3050129 / rank @@
+Normal rank
@@ Property / cites work @@
+Fast approximation algorithm for job sequencing with deadlines
+Normal rank
@@ Property / cites work @@
+THE MULTIPLE-CHOICE KNAPSACK PROBLEM
@@ Property / cites work: THE MULTIPLE-CHOICE KNAPSACK PROBLEM / rank @@
+Normal rank
@@ Property / cites work @@
+Fast Approximation Algorithms for Knapsack Problems
+Normal rank
@@ Property / cites work @@
+Q3993418
@@ Property / cites work: Q3993418 / rank @@
+Normal rank
@@ Property / cites work @@
+A note on 0.5-bounded greedy algorithms for the 0/1 knapsack problem
+Normal rank
@@ Property / cites work @@
+Approximate binary search algorithms for mean cuts and cycles
+Normal rank
@@ Property / cites work @@
+New scaling algorithms for the assignment and minimum mean cycle problems
+Normal rank
@@ Property / cites work @@
+A linear time randomizing algorithm for searching ranked functions
+Normal rank
@@ Property / OpenAlex ID @@
+W2076512004
@@ Property / OpenAlex ID: W2076512004 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:293371