Learn More
A discrete filled function method is developed in this paper to solve discrete global optimization problems over " strictly pathwise connected domains. " Theoretical properties of the proposed discrete filled function are investigated and a solution algorithm is proposed. Numerical experiments reported in this paper on several test problems with up to 200(More)
  • 1