A deterministic annealing algorithm for approximating a solution of the min-bisection problem (Q280315): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C35 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68W25 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C59 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6578187 / rank
 
Normal rank
Property / zbMATH Keywords
 
log-cos barrier function
Property / zbMATH Keywords: log-cos barrier function / rank
 
Normal rank
Property / zbMATH Keywords
 
descent direction
Property / zbMATH Keywords: descent direction / rank
 
Normal rank
Property / zbMATH Keywords
 
deterministic annealing
Property / zbMATH Keywords: deterministic annealing / rank
 
Normal rank
Property / zbMATH Keywords
 
iterative algorithm
Property / zbMATH Keywords: iterative algorithm / rank
 
Normal rank

Revision as of 18:25, 27 June 2023

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
    0 references
    0 references
    0 references
    10 May 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    log-cos barrier function
    0 references
    descent direction
    0 references
    deterministic annealing
    0 references
    iterative algorithm
    0 references