These tools will no longer be maintained as of December 31, 2024. Archived website can be found here. PubMed4Hh GitHub repository can be found here. Contact NLM Customer Service if you have questions.
3. A deterministic annealing algorithm for the minimum concave cost network flow problem. Dang C; Sun Y; Wang Y; Yang Y Neural Netw; 2011 Sep; 24(7):699-708. PubMed ID: 21482456 [TBL] [Abstract][Full Text] [Related]
4. A deterministic annealing algorithm for approximating a solution of the linearly constrained nonconvex quadratic minimization problem. Dang C; Liang J; Yang Y Neural Netw; 2013 Mar; 39():1-11. PubMed ID: 23296021 [TBL] [Abstract][Full Text] [Related]
5. An approximation algorithm for graph partitioning via deterministic annealing neural network. Wu Z; Karimi HR; Dang C Neural Netw; 2019 Sep; 117():191-200. PubMed ID: 31174047 [TBL] [Abstract][Full Text] [Related]
6. A globally convergent Lagrange and barrier function iterative algorithm for the traveling salesman problem. Dang C; Xu L Neural Netw; 2001 Mar; 14(2):217-30. PubMed ID: 11316235 [TBL] [Abstract][Full Text] [Related]
7. Approximating a solution of the s-t max-cut problem with a deterministic annealing algorithm. Dang C Neural Netw; 2000 Sep; 13(7):801-10. PubMed ID: 11152210 [TBL] [Abstract][Full Text] [Related]
8. A Deterministic Annealing Neural Network Algorithm for the Minimum Concave Cost Transportation Problem. Wu Z; Karimi HR; Dang C IEEE Trans Neural Netw Learn Syst; 2020 Oct; 31(10):4354-4366. PubMed ID: 31869806 [TBL] [Abstract][Full Text] [Related]