A deterministic annealing algorithm for approximating a solution of the min-bisection problem (Q280315)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A deterministic annealing algorithm for approximating a solution of the min-bisection problem |
scientific article; zbMATH DE number 6578187
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A deterministic annealing algorithm for approximating a solution of the min-bisection problem |
scientific article; zbMATH DE number 6578187 |
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
0 references
0 references
0.8083783984184265
0 references
0.7935144305229187
0 references
