Constraint programming is rapidly becoming the technology of choice for modelling and solving complex combinatorial problems. However, users of this technology need significant ex...
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 ...
We propose a 0/1 integer programming model to tackle the office space allocation (OSA) problem which refers to assigning room space to a set of entities (people, machines, roles, ...
Abstract. Combinatorial problems such as scheduling, resource allocation, and configuration have many attributes that can be subject of user preferences. Traditional optimization ...
By adapting to computations that are not so well supported by general-purpose processors, reconfigurable systems achieve significant increases in performance. Such computational sy...