Finding quasi core with simulated stacked neural networks (Q526647): Difference between revisions

@@ Property / author @@
-Sanghamitra Bandyopadhyay
@@ Property / author: Sanghamitra Bandyopadhyay / rank @@
-Normal rank
@@ Property / describes a project that uses @@
+QUALEX
@@ Property / describes a project that uses: QUALEX / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+DIMACS
@@ Property / describes a project that uses: DIMACS / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+darch
@@ Property / describes a project that uses: darch / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+Algorithm 457
@@ Property / describes a project that uses: Algorithm 457 / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+clusfind
@@ Property / describes a project that uses: clusfind / 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.1016/j.ins.2014.09.032
+Normal rank
@@ Property / OpenAlex ID @@
+W2077749535
@@ Property / OpenAlex ID: W2077749535 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4945528
@@ Property / cites work: Q4945528 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3044359
@@ Property / cites work: Q3044359 / rank @@
+Normal rank
@@ Property / cites work @@
+The Enumeration of Maximal Cliques of Large Graphs
+Normal rank
@@ Property / cites work @@
+Experiments in quadratic 0-1 programming
@@ Property / cites work: Experiments in quadratic 0-1 programming / rank @@
+Normal rank
@@ Property / cites work @@
+Q2928705
@@ Property / cites work: Q2928705 / rank @@
+Normal rank
@@ Property / cites work @@
+Bounds on Quasi-Completeness
@@ Property / cites work: Bounds on Quasi-Completeness / rank @@
+Normal rank
@@ Property / cites work @@
+Q3145799
@@ Property / cites work: Q3145799 / rank @@
+Normal rank
@@ Property / cites work @@
+Distributed Discovery of Large Near-Cliques
@@ Property / cites work: Distributed Discovery of Large Near-Cliques / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithm 457: finding all cliques of an undirected graph
+Normal rank
@@ Property / cites work @@
+A new trust region technique for the maximum weight clique problem
+Normal rank
@@ Property / cites work @@
+Q3619797
@@ Property / cites work: Q3619797 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4942157
@@ Property / cites work: Q4942157 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+A simple simulated annealing algorithm for the maximum clique problem
+Normal rank
@@ Property / cites work @@
+Clique is hard to approximate within \(n^{1-\epsilon}\)
+Normal rank
@@ Property / cites work @@
+Reducing the Dimensionality of Data with Neural Networks
+Normal rank
@@ Property / cites work @@
+``Neural'' computation of decisions in optimization problems
+Normal rank
@@ Property / cites work @@
+Finding Groups in Data
@@ Property / cites work: Finding Groups in Data / rank @@
+Normal rank
@@ Property / cites work @@
+Optimization by Simulated Annealing
@@ Property / cites work: Optimization by Simulated Annealing / rank @@
+Normal rank
@@ Property / cites work @@
+Q4472034
@@ Property / cites work: Q4472034 / rank @@
+Normal rank
@@ Property / cites work @@
+A fast algorithm for the maximum clique problem
@@ Property / cites work: A fast algorithm for the maximum clique problem / rank @@
+Normal rank
@@ Property / cites work @@
+A branch and bound algorithm for the maximum clique problem
+Normal rank
@@ Property / cites work @@
+Principles and Practice of Constraint Programming – CP 2003
+Normal rank
@@ Property / cites work @@
+An algorithm for finding a maximum clique in a graph
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:526647