A branch-and-bound algorithm for hard multiple knapsack problems (Q545544): Difference between revisions

@@ Property / Mathematics Subject Classification ID @@
+C27
@@ Property / Mathematics Subject Classification ID: 90C27 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+5911479
@@ Property / zbMATH DE Number: 5911479 / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+MULKNAP
@@ Property / describes a project that uses: MULKNAP / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+Knapsack
@@ Property / describes a project that uses: Knapsack / 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.1007/s10479-009-0660-y
+Normal rank
@@ Property / OpenAlex ID @@
+W2024626675
@@ Property / OpenAlex ID: W2024626675 / rank @@
+Normal rank
@@ Property / cites work @@
+A PTAS for the multiple subset sum problem with different knapsack capacities
+Normal rank
@@ Property / cites work @@
+A 3/4-approximation algorithm for multiple subset sum
+Normal rank
@@ Property / cites work @@
+Q4952619
@@ Property / cites work: Q4952619 / rank @@
+Normal rank
@@ Property / cites work @@
+The Loading Problem
@@ Property / cites work: The Loading Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q4475624
@@ Property / cites work: Q4475624 / rank @@
+Normal rank
@@ Property / cites work @@
+Pruning Moves
@@ Property / cites work: Pruning Moves / rank @@
+Normal rank
@@ Property / cites work @@
+A new dominance procedure for combinatorial optimization problems
+Normal rank
@@ Property / cites work @@
+Q4475622
@@ Property / cites work: Q4475622 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3624058
@@ Property / cites work: Q3624058 / rank @@
+Normal rank
@@ Property / cites work @@
+An algorithm for 0-1 multiple-knapsack problems
@@ Property / cites work: An algorithm for 0-1 multiple-knapsack problems / rank @@
+Normal rank
@@ Property / cites work @@
+An Algorithm for the Solution of 0-1 Loading Problems
+Normal rank
@@ Property / cites work @@
+Computational aspects of clearing continuous call double auctions with assignment constraints and indivisible demand
+Normal rank
@@ Property / cites work @@
+Upper bounds and algorithms for the maximum cardinality bin packing problem.
+Normal rank
@@ Property / cites work @@
+A bound and bound algorithm for the zero-one multiple knapsack problem
+Normal rank
@@ Property / cites work @@
+Q3993418
@@ Property / cites work: Q3993418 / rank @@
+Normal rank
@@ Property / cites work @@
+An exact algorithm for large multiple knapsack problems
+Normal rank
@@ Property / cites work @@
+Where are the hard knapsack problems?
@@ Property / cites work: Where are the hard knapsack problems? / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:545544