Abstract: To address the problems of slow convergence, low search accuracy, and easy fall into local optimum, and generating a large number of infeasible solutions when solving the 0–1 Knapsack ...
Abstract: Knapsack problem is a classical optimization problem in computer science and programming. Knapsack problem main objective is to solve how much the maximum profit can be carried with the ...
A major barrier to the wider use of supervised learning in emerging applications, such as genomic selection, is the lack of sufficient and representative labeled data to train prediction models. The ...
The best algorithm for a computational problem generally depends on the “relevant inputs,” a concept that depends on the application domain and often defies formal articulation. Although there is a ...
[Ahuja00] “A greedy genetic algorithm for the quadratic assignment problem”, R. Ahuja, J. Orlin, A. Tiwari, Computers and Operations Research, vol. 27, issue 10 (Sept. 2000), 917--934, ACM (2000) ...
The Dynamic Vehicle Routing Problem with Stochastic Requests (DVRPSR) is a prototypical problem in transportation logistics. The DVRPSR calls for an initial route plan and an online scheduling policy ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results