A deterministic annealing algorithm for the minimum concave cost network flow problem

Neural Networks

Volumn 24, Issue 7, 2011, Pages 699-708

  Dang, Chuangyin ^a   Sun, Yabin ^a   Wang, Yuping ^b   Yang, Yang ^c  

^a CITY UNIVERSITY OF HONG KONG   (Hong Kong)

^b XIDIAN UNIVERSITY   (China)

^c XUZHOU INSTITUTE OF TECHNOLOGY   (China)

Author keywords

Barrier function; Combinatorial optimization; Concave cost; Descent direction; Deterministic annealing; Iterative method; Lagrange and barrier function; Lagrange multiplier; Network flow

Indexed keywords

COMBINATORIAL OPTIMIZATION; COSTS; ITERATIVE METHODS; RAPID THERMAL ANNEALING;

BARRIER FUNCTIONS; CONCAVE COST; DESCENT DIRECTIONS; DETERMINISTIC ANNEALING; NETWORK FLOWS;

LAGRANGE MULTIPLIERS;

ALGORITHM; ANALYTICAL PARAMETERS; ARTICLE; AUTOMATION; FEASIBILITY STUDY; MATHEMATICAL ANALYSIS; MATHEMATICAL COMPUTING; MATHEMATICAL PARAMETERS; MATHEMATICS; PRIORITY JOURNAL; STATISTICAL ANALYSIS;

EID: 79960889663     PISSN: 08936080     EISSN: 18792782     Source Type: Journal    
DOI: 10.1016/j.neunet.2011.03.018     Document Type: Article

References (36)

1. Aiyer S., Niranjan M., Fallside F. A theoretical investigation into the performance of the Hopfield model. IEEE Transactions on Neural Networks 1990, 1:204-215.
2. Berg, J.van den (1996). Neural relaxation dynamics. Ph.D. thesis. Erasmus University of Roterdam, The Netherlands.
3. Bout D.van den, Miller T. Graph partitioning using annealed networks. IEEE Transactions on Neural Networks 1990, 1:192-203.
4. Cichocki A., Unbehaunen R. Neural networks for optimization and signal processing 1993, John Wiley & Sons, New York.
5. Dang C., Xu L. A Lagrange multiplier and Hopfield-type barrier function method for the traveling salesman problem. Neural Computation 2001, 14:303-324.
6. Durbin R., Willshaw D. An analogue approach to the traveling salesman problem using an elastic network method. Nature 1987, 326:689-691.
7. Feig U., Kuauthgamer R. A polylogarithmic approximation of the minimum bisection. SIAM Review 2006, 48(1):99-130.
8. Fontes D.B.M.M., Goncalves J.F. Heuristic solution for general concave minimum cost network flow problems. Networks 2007, 50(1):67-76.
9. Fontes D.B.M.M., Hadjiconstantinou E., Christofides N. A branch-and bound algorithm for concave network flow problems. Journal of Global Optimization 2006, 34(1):127-155.
10. Fontes D.B.M.M., Hadjiconstantinou E., Christofides N. A dynamic programming approach for single-source uncapacitated concave minimum-cost network flow problems. European Journal of Operational Research 2006, 174(2):1205-1219.
11. Fontes D.B.M.M., Hadjiconstantinou E., Christofides N. Upper bounds for single-source uncapacitated concave minimum-cost network flow problems. Networks 2003, 41(4):221-228.
12. Gee A., Aiyer S., Prager R. An analytical framework for optimizing neural networks. Neural Networks 1993, 6:79-97.
13. Gee A., Prager R. Polyhedral combinatorics & neural networks. Neural Computation 1994, 6:161-180.
14. Guisewite G.M. Network problems. Handbook of global optimization 1995, Kluwer Academic Publishers. R. Horst, P.M. Pardalos (Eds.).
15. Hopfield J., Tank D. Neural computation of decisions in optimization problems. Biological Cybernetics 1985, 52:141-152.
16. Horio Y., Ikeguchi T., Aihara K. A mixed analog/digital chaotic neuro-computer system for quadratic assignment problems. Neural Networks 2005, 18:505-513.
17. Ishii T., Iwata K., Nagamochi H. Bisecting a 4-connected graph with three resource sets. Discrete Applied Mathematics 2007, 155:1441-1450.
18. Kim H.J., Hooker J. Solving fixed charge network flow problems with a hybrid optimization and constraint programming approach. Annals of Operations Research 2002, 115:95-124.
19. Minoux M. Mathematical programming: theory and algorithms 1986, John Wiley & Sons.
20. Ortega F., Welsey L.A. A branch-and-cut algorithm for the single commodity uncapacitated, fixed-charge network flow problems. Networks 2003, 41:143-158.
21. Pardalos P., Rosen J. Constrained global optimization: algorithms and applications. Lecture notes in computer science 1987, Vol. 268. Springer-Varlag.
22. Peterson C., Soderberg B. A new method for mapping optimization problems onto neural networks. International Journal of Neural Systems 1989, 1:3-22.
23. Rangarajan A., Gold S., Mjolsness E. A novel optimizing network architecture with applications. Neural Computation 1996, 8:1041-1060.
24. Simic P. Statistical mechanics as the underlying theory of elastic and "neural" optimizations. Networks 1990, 1:89-103.
25. Trudeau C. Network flow problems and permutationally concave games. Mathematical Social Science 2009, 58(1):121-131.
26. Urahama K. Gradient projection network: analog solver for linearly constrained nonlinear programming. Neural Computation 1996, 6:1061-1073.
27. Wacholder E., Han J., Mann R. A neural network algorithm for the multiple traveling salesman problem. Biological Cybernetics 1989, 61:11-19.
28. Wang J., Xia Y.S. Analysis and design of primal-dual assignment networks. IEEE Transactions on Neural Networks 1998, 9:183-194.
29. Waugh F., Westervelt R. Analog neural networks with local competition: I. Dynamics and stability. Physical Review E 1993, 47:4524-4536.
30. Wolfe W., Parry M., MacMillan J. Hopfield-style neural networks and the TSP. IEEE International Conference on Neural Networks 1994, 7:4577-4582.
31. Wu J. Annealing by two sets of interactive dynamics. IEEE Transactions on Systems, Man, and Cybernetics-Part B: Cybernetics 2004, 34(3):1519-1525.
32. Xia Y.S. An extended projection neural network for constrained optimization. Neural Computation 2004, 16(4):863-883.
33. Xia Y.S. New cooperative projection neural network for nonlinearly constrained variational inequality. Science in China Series F-Information Sciences 2009, 52(10):1766-1777.
34. Xia Y.S., Feng G. A new neural network for solving nonlinear projection equations. Neural Networks 2007, 20(5):577-589.
35. Xu, L. (1994). Combinatorial optimization neural nets based on a hybrid of Lagrange and transformation approaches. In Proceedings of the world congress on neural networks (pp. 399-404). San Diego.
36. Yuille A., Kosowsky J. Statistical physics algorithms that converge. Neural Computation 1994, 6:341-356.