A deterministic annealing algorithm for approximating a solution of the min-bisection problem

DOI10.1016/j.neunet.2008.09.008zbMath1335.90104WikidataQ47245591 ScholiaQ47245591MaRDI QIDQ280315

Chuangyin Dang, Wei Ma, J. Y. Liang

Publication date: 10 May 2016

Published in: Neural Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.neunet.2008.09.008

zbMATH Keywords

iterative algorithm; deterministic annealing; descent direction; log-cos barrier function

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

90C59: Approximation methods and heuristics in mathematical programming

68W25: Approximation algorithms

Related Items

Transformation of energy landscape in the problem of binary minimization