Abstract: This paper presents a novel neural network-based optimization framework, NNDE, to solve the traveling salesman problem (TSP). The core idea is to use a radial basis function network (RBFN) ...
Abstract: The multiple-choice knapsack problem (MCKP) is a classic NP-hard combinatorial optimization problem. Motivated by several significant real-world applications, this work investigates a novel ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results