The knapsack sharing problem has a utility or tradeoff function for each variable and seeks to maximize the value of the smallest tradeoff function (a maximin objective function). A single constraint ...

https://doi.org/10.2307/2583858 • https://www.jstor.org/stable/2583858 Copy URL The objective of this study is to use the simulated annealing method to solve ...

In computer science, normally we care about asymptotic speedup: We care about, “What is your running time as a function of the size of the problem? Does it grow linearly? Does it grow quadratically?” ...