Skip to main content
SpringerLink
Log in
Book cover

Encyclopedia of Optimization pp 3279–3291Cite as

Replicator Dynamics in Combinatorial Optimization

  • Reference work entry

Article Outline

Keywords

The Model and its Properties

Maximum Clique Problems

Graph Isomorphism

Subtree Isomorphism

A Geometric Problem

Multipopulation Models

Conclusions

See also

References

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   2,500.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD   2,499.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Barrow HG, Burstall RM (1976) Subgraph isomorphism, matching relational structures and maximal cliques. Inform Process Lett 4(4):83–84

    Article  MATH  Google Scholar 

  2. Baum LE, Eagon JA (1967) An inequality with applications to statistical estimation for probabilistic functions of Markov processes and to a model for ecology. Bull Amer Math Soc 73:360–363

    Article  MATH  MathSciNet  Google Scholar 

  3. Baum LE, Sell GR (1968) Growth transformations for functions on manifolds. Pacific J Math 27(2):211–227

    MATH  MathSciNet  Google Scholar 

  4. Bollobás B, Erdös P (1976) Cliques in random graphs. Math Proc Cambridge Philos Soc 80:419–427

    MATH  MathSciNet  Google Scholar 

  5. Bomze IM (1997) Evolution towards the maximum clique. J Global Optim 10:143–164

    Article  MATH  MathSciNet  Google Scholar 

  6. Bomze IM (1997) Global escape strategies for maximizing quadratic forms over a simplex. J Global Optim 11:325–338

    Article  MATH  MathSciNet  Google Scholar 

  7. Bomze IM (1998) On standard quadratic optimization problems. J Global Optim 13:369–387

    Article  MATH  MathSciNet  Google Scholar 

  8. Bomze IM, Budinich M, Pardalos PM, Pelillo M (1999) The maximum clique problem. In: Du D-Z, Pardalos PM (ed) Handbook Combinatorial Optim, Suppl A. Kluwer, Dordrecht, pp 1–74

    MathSciNet  Google Scholar 

  9. Bomze IM, Budinich M, Pelillo M, Rossi C (2000) An new “annealed” heuristic for the maximum clique problem. Approximation and Complexity in Numerical Optimization: Continuous and Discrete Problems. In: Pardalos PM (eds) Kluwer, Dordrecht, pp 78–95

    Google Scholar 

  10. Bomze IM, Pelillo M, Giacomini R (1997) Evolutionary approach to the maximum clique problem: Empirical evidence on a larger scale. Developments in Global Optimization, pp 95–108

    Google Scholar 

  11. Bomze IM, Pelillo M, Stix V (2000) Approximating the maximum weight clique using replicator dynamics. IEEE Trans Neural Networks 11(6)

    Google Scholar 

  12. Bomze IM, Rendl F (1998) Replicator dynamics for evolution towards the maximum clique: Variations and experiments. High Performance Algorithms and Software in Nonlinear Optimization. In: De Leone R, Murlĭ A, Pardalos PM, Toraldo G (eds) Kluwer, pp 53–67

    Google Scholar 

  13. Bomze IM, Stix V (1999) Genetic engineering via negative fitness: Evolutionary dynamics for global optimization. Ann Oper Res 90

    Google Scholar 

  14. Boppana RB, Hastad J, Zachos S (1987) Does co-NP have short interactive proofs? Inform Process Lett 25:127–132

    Article  MATH  MathSciNet  Google Scholar 

  15. Cabrales A, Sobel J (1992) On the limit points of discrete selection dynamics. J Econom Theory 57:407–419

    Article  MATH  MathSciNet  Google Scholar 

  16. Courrieu P (1994) Three algorithms for estimating the domain of validity of feedforward neural networks. Neural Networks 7(1):169–174

    Article  Google Scholar 

  17. Crow JF, Kimura M (1970) An introduction to population genetics theory. Harper and Row, New York

    MATH  Google Scholar 

  18. Fisher RA (1930) The genetical theory of natural selection. Oxford Univ Press, Oxford

    MATH  Google Scholar 

  19. Garey MR, Johnson DS (1979) Computers and intractability: A guide to the theory of NP-completeness. Freeman, New York

    MATH  Google Scholar 

  20. Gaunersdorfer A, Hofbauer J (1995) Fictitious play, Shapley polygons, and the replicator equation. Games Econom Behav 11:279–303

    Article  MATH  MathSciNet  Google Scholar 

  21. Gibbons LE, Hearn DW, Pardalos PM, Ramana MV (1997) Continuous characterizations of the maximum clique problem. Math Oper Res 22:754–768

    MATH  MathSciNet  Google Scholar 

  22. Hofbauer J (1995) Imitation dynamics for games. Preprint Collegium Budapest

    Google Scholar 

  23. Hofbauer J, Sigmund K (1998) Evolutionary games and population dynamics. Cambridge Univ Press, Cambridge

    MATH  Google Scholar 

  24. Hofbauer J, Weibull JW (1996) Evolutionary selection against dominated strategies. J Econom Theory 71:558–573

    Article  MATH  MathSciNet  Google Scholar 

  25. Hummel RA, Zucker SW (1983) On the foundations of relaxation labeling processes. IEEE Trans Pattern Anal Machine Intell 5:267–287

    MATH  Google Scholar 

  26. Jagota A (1995) Approximating maximum clique with a Hopfield neural network. IEEE Trans Neural Networks 6:724–735

    Article  Google Scholar 

  27. Jerrum M (1992) Large cliques elude the Metropolis process. Random Struct Algorithms 3:347–359

    Article  MATH  MathSciNet  Google Scholar 

  28. Johnson DS (1988) The NP-completeness column: An ongoing guide. J Algorithms 9:426–444

    Article  MATH  MathSciNet  Google Scholar 

  29. Kamp Y, Hasler M (1990) Recursive neural networks for associative memory. Wiley, New York

    MATH  Google Scholar 

  30. Kozen D (1978) A clique problem equivalent to graph isomorphism. SIGACT News 50–52

    Google Scholar 

  31. Krauth W, MÉzard M (1987) Learning algorithms with optimal stability in neural networks. J Phys A 20:L745–L752

    Article  Google Scholar 

  32. Losert V, Akin E (1983) Dynamics of games and genes: Discrete versus continuous time. J Math Biol 17:241–251

    Article  MATH  MathSciNet  Google Scholar 

  33. Luce RD, Raiffa H (1957) Games and decisions. Wiley, New York

    MATH  Google Scholar 

  34. Yu. Lyubich, Maistrowskii GD, Ol'khovskii Yu G (1980) Selection-induced convergence to equilibrium in a single-locus autosomal population. Probl Inform Transmission 16:66–75

    Google Scholar 

  35. Matula DW (1976) The largest clique size in a random graph. Techn Report, Dept Computer Sci, Southern Methodist Univ, CS7608

    Google Scholar 

  36. Maynard-Smith J (1982) Evolution and the theory of games. Cambridge Univ Press, Cambridge

    Google Scholar 

  37. Miller DA, Zucker SW (1991) Copositive-plus Lemke algorithm solves polymatrix games. Oper Res Lett 10:285–290

    Article  MATH  MathSciNet  Google Scholar 

  38. Motzkin TS, Straus EG (1965) Maxima for graphs and a new proof of a theorem of Turán. Canad J Math 17:533–540

    MATH  MathSciNet  Google Scholar 

  39. Mühlenbein H, Gorges-Schleuter M, Kräamer O (1988) Evolution algorithms in combinatorial optimization. Parallel Comput 7:65–85

    Article  MATH  Google Scholar 

  40. Pardalos PM, Phillips AT (1990) A global optimization approach for solving the maximum clique problem. Internat J Comput Math 33:209–216

    Article  MATH  Google Scholar 

  41. Pelillo M (1993) Relaxation labeling processes for the traveling salesman problem. Proc Internat J Conf Neural Networks, pp 2429–2432

    Google Scholar 

  42. Pelillo M (1995) Relaxation labeling networks for the maximum clique problem. J Artif Neural Networks 2:313–328

    Google Scholar 

  43. Pelillo M (1996) A relaxation algorithm for estimating the domain of validity of feedforward neural networks. Neural Proc Lett 3, no(3):113–121

    Article  Google Scholar 

  44. Pelillo M (1997) The dynamics of nonlinear relaxation labeling processes. J Math Imaging Vision 7(4):309–323

    Article  MathSciNet  Google Scholar 

  45. Pelillo M (1998) A unifying framework for relational structure matching. Proc 14th Internat Conf Pattern Recognition, IEEE Computer Soc Press, pp 1316–1319

    Google Scholar 

  46. Pelillo M (1999) Replicator equations, maximal cliques, and graph isomorphism. Neural Computation 11(8):2023–2045

    Article  Google Scholar 

  47. Pelillo M, Jagota A (1995) Feasible and infeasible maxima in a quadratic program for maximum clique. J Artif Neural Networks 2:411–420

    Google Scholar 

  48. Pelillo M, Siddiqi K, Zucker SW (1999) Matching hierarchical structures using association graphs. IEEE Trans Pattern Anal Machine Intell 21(11):1105–1120

    Article  Google Scholar 

  49. Preparata FP, Shamos MI (1985) Computational geometry: An introduction. Springer, Berlin

    Google Scholar 

  50. Rosenfeld A, Hummel RA, Zucker SW (1976) Scene labeling by relaxation operations. IEEE Trans Syst, Man Cybern 6:420–433

    Article  MATH  MathSciNet  Google Scholar 

  51. Ruján P (1993) A fast method for calculating the perceptron with maximal stability. J Phys I France 3:277–290

    Article  Google Scholar 

  52. Schöning U (1988) Graph isomorphism is in the low hierarchy. J Comput Syst Sci 37:312–323

    Article  MATH  Google Scholar 

  53. Taylor P, Jonker L (1978) Evolutionarily stable strategies and game dynamics. Math Biosci 40:145–156

    Article  MATH  MathSciNet  Google Scholar 

  54. Waugh FR, Westervelt RM (1993) Analog neural networks with local competition. I. Dynamics and stability. Phys Rev E 47(6):4524–4536

    Article  MathSciNet  Google Scholar 

  55. Weibull JW (1995) Evolutionary game theory. MIT, Cambridge

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University Ca' Foscari di Venezia, Venice, Italy

    Marcello Pelillo

Authors
  1. Marcello Pelillo
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Chemical Engineering, Princeton University, Princeton, NJ, 08544-5263, USA

    Christodoulos A. Floudas

  2. Center for Applied Optimization, Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL, 32611-6595, USA

    Panos M. Pardalos

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag

About this entry

Cite this entry

Pelillo, M. (2008). Replicator Dynamics in Combinatorial Optimization . In: Floudas, C., Pardalos, P. (eds) Encyclopedia of Optimization. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-74759-0_562

Download citation

Publish with us

Policies and ethics

Search

Navigation