An Adaptive Neighborhood Search for k-Clustering Minimum Bi-clique Completion Problems (Q5356965): 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-319-18161-5_2
+Normal rank
@@ Property / OpenAlex ID @@
+W1146855678
@@ Property / OpenAlex ID: W1146855678 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4411385
@@ Property / cites work: Q4411385 / rank @@
+Normal rank
@@ Property / cites work @@
+Biclique completion problems for multicast network design
+Normal rank
@@ Property / cites work @@
+k-Clustering Minimum Biclique Completion via a Hybrid CP and SDP Approach
+Normal rank
@@ Property / cites work @@
+A branch‐and‐price approach to <i>k</i>‐clustering minimum biclique completion problem
+Normal rank
@@ Property / cites work @@
+A reactive local search-based algorithm for the disjunctively constrained knapsack problem
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for combinatorial problems
+Normal rank