Complexity and heuristics for the weighted max cut‐clique problem (Q6091425): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1111/itor.12807
+Normal rank
@@ Property / OpenAlex ID @@
+W3021789649
@@ Property / OpenAlex ID: W3021789649 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of theorem-proving procedures
@@ Property / cites work: The complexity of theorem-proving procedures / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Handbook of metaheuristics
@@ Property / cites work: Handbook of metaheuristics / rank @@
+Normal rank
@@ Property / cites work @@
+Q4354785
@@ Property / cites work: Q4354785 / rank @@
+Normal rank
@@ Property / cites work @@
+Solving the maximum edge-weight clique problem in sparse graphs with compact formulations
+Normal rank
@@ Property / cites work @@
+Enumerating Isolated Cliques in Synthetic and Financial Networks
+Normal rank
@@ Property / cites work @@
+Reducibility among Combinatorial Problems
@@ Property / cites work: Reducibility among Combinatorial Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Cliques with maximum/minimum edge neighborhood and neighborhood density
+Normal rank
@@ Property / cites work @@
+Maximum cut-clique problem: ILS heuristics and a data analysis application
+Normal rank
@@ Property / cites work @@
+Approximating the maximum vertex/edge weighted clique using local search
+Normal rank
@@ Property / cites work @@
+Optimization by GRASP
@@ Property / cites work: Optimization by GRASP / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:6091425