[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 (KP) and Bin Packing Problem (BPP) are NP-hard combinatorial optimization challenges often tackled using metaheuristics. Both problems have prominent utilization in ...
We independently review everything we recommend. When you buy through our links, we may earn a commission. Learn more› By Elissa Sanci Elissa Sanci is a senior writer who has reported on label makers, ...
Abstract: We study two canonical online optimization problems under capacity/budget constraints: the fractional one-way trading problem (OTP) and the integral online knapsack problem (OKP) under an ...
This is example Ruby on Rails app with knapsack gem. Knapsack splits tests across CI nodes and makes sure that tests will run comparable time on each node. You can read more about free knapsack gem ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback