0-1 quadratic knapsack problem solved with VNS algorithm (Q2631284): 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.endm.2014.11.035
+Normal rank
@@ Property / OpenAlex ID @@
+W2048078357
@@ Property / OpenAlex ID: W2048078357 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3835301
@@ Property / cites work: Q3835301 / rank @@
+Normal rank
@@ Property / cites work @@
+Quadratic knapsack problems
@@ Property / cites work: Quadratic knapsack problems / rank @@
+Normal rank
@@ Property / cites work @@
+Variable neighborhood search: Principles and applications
+Normal rank
@@ Property / cites work @@
+Efficient Methods For Solving Quadratic 0–1 Knapsack Problems
+Normal rank
@@ Property / cites work @@
+A general variable neighborhood search for solving the uncapacitated single allocation \(p\)-hub median problem
+Normal rank
@@ Property / cites work @@
+Variable neighborhood search for location routing
@@ Property / cites work: Variable neighborhood search for location routing / rank @@
+Normal rank
@@ Property / cites work @@
+Lagrangean methods for the 0-1 quadratic knapsack problem
+Normal rank
@@ Property / cites work @@
+An effective GRASP and tabu search for the 0-1 quadratic knapsack problem
+Normal rank