Computational approaches to a combinatorial optimization problem arising from text classification (Q868131): Difference between revisions

@@ Property / DOI @@
-.1016/j.cor.2005.07.021
@@ Property / DOI: 10.1016/j.cor.2005.07.021 / rank @@
-Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.cor.2005.07.021
+Normal rank
@@ Property / OpenAlex ID @@
+W2065714407
@@ Property / OpenAlex ID: W2065714407 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2763165
@@ Property / cites work: Q2763165 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3056948
@@ Property / cites work: Q3056948 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4365126
@@ Property / cites work: Q4365126 / rank @@
+Normal rank
@@ Property / cites work @@
+Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing
+Normal rank
@@ Property / cites work @@
+Best-so-far vs. where-you-are: Implications for optimal finite-time annealing
+Normal rank
@@ Property / cites work @@
+Optimization by Simulated Annealing
@@ Property / cites work: Optimization by Simulated Annealing / rank @@
+Normal rank
@@ Property / cites work @@
+Q3785827
@@ Property / cites work: Q3785827 / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.COR.2005.07.021
@@ Property / DOI: 10.1016/J.COR.2005.07.021 / rank @@
+Normal rank