A deterministic annealing algorithm for approximating a solution of the min-bisection problem (Q280315): Difference between revisions
From MaRDI portal
Set profile property. |
Created claim: Wikidata QID (P12): Q47245591, #quickstatements; #temporary_batch_1719280132499 |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.neunet.2008.09.008 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4233980468 / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q47245591 / rank | |||
Normal rank | |||
Latest revision as of 03:50, 25 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A deterministic annealing algorithm for approximating a solution of the min-bisection problem |
scientific article |
Statements
A deterministic annealing algorithm for approximating a solution of the min-bisection problem (English)
0 references
10 May 2016
0 references
log-cos barrier function
0 references
descent direction
0 references
deterministic annealing
0 references
iterative algorithm
0 references
