Probabilistic Model of Ant Colony Optimization for Multiple Knapsack Problem (Q3616856): 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.1007/978-3-540-78827-0_62
+Normal rank
@@ Property / OpenAlex ID @@
+W1563004016
@@ Property / OpenAlex ID: W1563004016 / rank @@
+Normal rank
@@ Property / cites work @@
+New directions in cryptography
@@ Property / cites work: New directions in cryptography / rank @@
+Normal rank
@@ Property / cites work @@
+Solving Multiple Knapsack Problems by Cutting Planes
+Normal rank
@@ Property / cites work @@
+Ant colonies for the quadratic assignment problem
@@ Property / cites work: Ant colonies for the quadratic assignment problem / rank @@
+Normal rank
@@ Property / cites work @@
+Stochastic on-line knapsack problems
@@ Property / cites work: Stochastic on-line knapsack problems / rank @@
+Normal rank
@@ Property / cites work @@
+A Mixture of Dynamic Programming and Branch-and-Bound for the Subset-Sum Problem
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:3616856