scholar.google.com › citations
Oct 11, 2021 · In this paper, we transform the max-bisection problem to an artificial linearly constrained optimization problem and develop a modified deterministic annealing ...
A more efficient deterministic annealing neural network algorithm for the max-bisection problem. https://doi.org/10.1016/j.neucom.2021.06.050 ·. Journal ...
The max-bisection problem has extensive applications in network engineering, making it imperative to develop effective methods to solve this problem.
The max-bisection problem is an NP-hard combinatorial optimization problem. In this paper an equivalent linearly constrained continuous optimization problem ...
The max-bisection problem is an NP-hard combinatorial optimization problem. In this paper an equivalent linearly constrained continuous optimization problem ...
Missing: efficient | Show results with:efficient
In this article, a deterministic annealing neural network algorithm is proposed to solve the minimum concave cost transportation problem.
This paper presents a deterministic annealing EM (DAEM) algorithm for maximum likelihood estimation problems to overcome a local maxima problem associated with ...
A more efficient deterministic annealing neural network algorithm for the max-bisection problem. Shicong Jiang, Chuangyin Dang. https://doi.org/10.1016/j ...
A deterministic annealing algorithm for approximating a solution of the max-bisection problem · Computer Science, Mathematics. Neural Networks · 2002.
A more efficient deterministic annealing neural network algorithm for the max-bisection problem. Neurocomputing, Vol. 458 | 1 Oct 2021. The Efficiency of ...