Semidefinite optimization, commonly referred to as semidefinite programming, has been a remarkably active area of research in optimization during the last decade. For combinatoria...
The paper focuses on the study of solving the large-scale traveling salesman problem (TSP) based on neurodynamic programming. From this perspective, two methods, temporal differenc...
Jia Ma, Tao Yang, Zeng-Guang Hou, Min Tan, Derong ...
Abstract. We prove some results related to the problem of blowing up the power set of the least measurable cardinal. Our forcing results improve those of [1] by using the optimal h...
This paper describes some observations derived from teaching a course in software engineering to a mixed audience of undergraduates and professional Master's degree students ...
We consider an optimization problem of finding the best possible offspring as a result of a recombination operator in an evolutionary algorithm, given two parent solutions. The op...