Non-linear integer programming by Darwin and Boltzmann mixed strategy
Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review
Author(s)
Related Research Unit(s)
Detail(s)
| Original language | English |
|---|---|
| Pages (from-to) | 224-235 |
| Journal / Publication | European Journal of Operational Research |
| Volume | 105 |
| Issue number | 1 |
| Publication status | Published - 16 Feb 1998 |
Link(s)
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.
In: European Journal of Operational Research, Vol. 105, No. 1, 16.02.1998, p. 224-235.
Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review
