Non-linear integer programming by Darwin and Boltzmann mixed strategy

Research output: Journal Publications and Reviews (RGC: 21, 22, 62)21_Publication in refereed journalNot applicablepeer-review

11 Scopus Citations
View graph of relations

Author(s)

Related Research Unit(s)

Detail(s)

Original languageEnglish
Pages (from-to)224-235
Journal / PublicationEuropean Journal of Operational Research
Volume105
Issue number1
Publication statusPublished - 16 Feb 1998

Abstract

Non-linear integer programming (NIP) is a NP-complete problem with extensive theoretical and practical backgrounds. Based on our proposed Darwin and Boltzmann mixed strategy, this paper presents a general stochastic iterative algorithm for the NIP problems. The algorithm synthesizes the advantages of the Darwin strategy and the Boltzmann annealing strategy. It converges asymptotically to the global optimums and has shown to be polynomial in complexity. The experimental evaluations also show that the proposed algorithm is more efficient than the simulated annealing algorithm. © 1998 Elsevier Science B.V.

Research Area(s)

  • Darwin and Boltzmann mixed strategy, Global convergence, Non-linear integer programming, Optimization, Polynomial algorithm

Citation Format(s)

Non-linear integer programming by Darwin and Boltzmann mixed strategy. / Tian, Peng; Ma, Jian; Zhang, Dong-Mo.

In: European Journal of Operational Research, Vol. 105, No. 1, 16.02.1998, p. 224-235.

Research output: Journal Publications and Reviews (RGC: 21, 22, 62)21_Publication in refereed journalNot applicablepeer-review