H. Tran Van

Learn More
In this paper, we consider a class of optimization problems having the following characteristics: there exists a fixed number k (1≤k<n) which does not depend on the size n of the problem such that if we randomly change the value of k variables, it has the ability to find a new solution that is better than the current one, we call it O k. We build a new set(More)
  • 1