Abstract: In this paper, we propose a hybrid particle swarm optimization-based algorithm for approximately solving the set-union knapsack problem. Knapsack problem arises in several applications such ...
[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) ...
Abstract: The 0-1 knapsack problem is a typical discrete combinatorial optimization problem with numerous applications. In this paper, a binary multi-scale quantum harmonic oscillator algorithm ...
The advancements of mobile devices, public networks and the Internet of creature huge amounts of complex data, both construct & unstructured are being captured in trust to allow organizations to ...
We could say that breaking down the play of Catan into algorithms and probability charts takes all the fun out. Then again, we’re discussing a game that’s about managing supplies of wool and grain.
Some results have been hidden because they may be inaccessible to you
Show inaccessible results