Non-linear integer programming by Darwin and Boltzmann mixed strategy

Peng Tian

doi:10.1016/S0377-2217(97)00024-6

Return

Non-linear integer programming by Darwin and Boltzmann mixed strategy

1998-02-01

PRE

Peng Tian *

Jian Ma

Dongmo Zhang

DOI：10.1016/S0377-2217(97)00024-6

Original

Original request for help

Save

Abstract

En 中文

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. (C) 1998 Elsevier Science B.V.

Keywords:

optimization

non-linear integer programming

Darwin and Boltzmann mixed strategy

global convergence

polynomial algorithm

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.