Neural Networks without Training for Optimization - Neural Networks: Methodology and Applications - page 488

44. Mitra D., Romeo F., Sangiovanni-Vincentelli A. [1986], Convergence and finite-
time behavior of simulated annealing, Adv. Appl. Prob. , vol. 18, pp 747-771,
1986
45. Mjolsness E., Garrett C. [1990], Algebraic transformations of objective func-
tions, Neural Networks , no 3, pp 651-669, 1990
46. Mjolsness E., Miranker W.L. [1991], A Lagrangian approach to fixed points, Ad-
vances in Neural Information Processing Systems 3 , pp 77-83, Morgan Kaufman
Pub., 1991
47. Newcomb R.W., Lohn J.D. [1995], Analog VLSI for neural networks, The Hand-
book of Brain Theory and Neural Networks , The MIT Press, pp 86-90, 1995
48. Ohlsson M., Peterson C., Soderberg B. [1993], Neural networks for optimization
problems with inequality constraints - the knapsack problem, Neural Compu-
tation , vol. 5, no 2, pp 331-339, 1993
49. Osman I, Kelly J.P. [1996], Meta-heuristics: theory and applications ,Kluwer
Academic Publishers, 1996
50. Peterson C., Anderson J.R. [1988], Neural networks and NP-complete optimiza-
tion problems: a performance study on the graph bisection problem, Complex
Systems , vol. 2, pp 59-89, 1988
51. Peterson C., Soderberg B. [1989], A new method for mapping optimization
problems onto neural networks, International Journal on Neural Systems , vol.
1, pp 3-22, 1989
52. Peterson C. [1990], Parallel distributed approaches to combinatorial optimiza-
tion: benchmark studies on travelling salesman problem, Neural Computation ,
vol. 2, pp 261-269, 1990
53. Prins C. [1994], Algorithmes de graphes , Editions Eyrolles, 1994
54. Privault C., Herault L. [1998a], Constraints satisfaction through recursive neural
networks with mixed penalties: a case study, Neural Processing Letters ,Kluwer
Academic Publishers, vol. 8, no 1, pp 15-26, 1998
55. Privault C., Herault L. [1998b], Solving a real world assignment problem with
a metaheuristic, Journal of Heuristics , vol. 4, pp 383-398, Kluwer Academic
Publishers, 1998
56. Rangarajan A., Gold S. [1995], Softmax to softassign: neural network algorithms
for combinatorial optimization, Journal of Artificial Neural Networks ,vol.2,no
4, pp 381-399, 1995
57. Rangarajan A., Mjolsness E.D. [1996], A Lagrangian relaxation network for
graph matching, IEEE Transactions on Neural Networks , vol. 7, no 6, pp 1365-
81, 1996
58. Rangarajan A., Yuille A., Mjolsness E.D. [1999], Convergence properties of the
softassign quadratic assignment algorithm, Neural Computation , vol. 11, no 6,
pp 1455-1474, 1999
59. Rardin R.L., Uzsoy R. [2001], Experimental evaluation of heuristic optimisation
algorithms: a tutorial, Journal of Heuristics , vol. 7, no 3, pp 261-304, 2001
60. Reeves C.R. [1995], Modern Heuristic Techniques for Combinatorial Problems ,
McGraw-Hill, 1995
61. Reinelt G. [1994], The travelling salesman. Computational solutions for TSP
applications ,notedelecture in Computer Scienc e 840, Springer Verlag, 1994
62. Roussel-Ragot P., Dreyfus G. [1990], A Problem-Independent Parallel Imple-
mentation of Simulated Annealing: Models and Experiments, IEEE Transac-
tions on Computer-Aided Design , vol. 9, p. 827, 1990