The random-order or secretary model is one of the most popular beyond-worst case model for online algorithms. While this model avoids the pessimism of the traditional adversarial model, in practice we ...
Abstract: This paper aims to discuss and compare various metaheuristic algorithms applied to the “Knapsack Problem”. The Knapsack Problem is a combinatorial optimization maximization problem which ...
Abstract: The knapsack allocation problem in unmanned systems has been extensively studied in operations research and management science literature, and finding efficient solutions has consistently ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback