We also take out computational experience using the commercial software Gurobi and a greedy algorithm (GA), respec- tively. The outcome indicates that the suggest models are active and worka- ble. This paper in
1.1 Preliminaries For any input sequence, σ , and algorithm, Alg, for the Online Unit Profit Knapsack Problem, Alg(σ ) denotes the number of items accepted by Alg when processing σ . We use the asymptotic competitive ratio throughout this paper. Thus, an algo- rithm Alg, is c-...
The GRASP involves generating solutions using a randomized greedy algorithm and applying a local search to each of them. The FSS has been successfully applied to solve several problems, including the traveling salesman problem (Jovanovic et al. 2019), the power dominating set problem (Jovanovic ...
In the problem setup by Briest et al. (2012), the follower has to select a set of items within a given weight and in minimum cost. Since the follower is computationally bounded, she uses a greedy 2-approximation algorithm. The authors give a (2 + ϵ)-approximation algorithm to ...
A comparative study of meta-heuristic optimization algo- rithms for 0–1 knapsack problem: some initial results. IEEE Access. 2019;7:43979–4001. 23. Zhan S-H, Zhang Z-J, Wang L-J, Zhong Y-W. List-based simulated annealing algorithm with hybrid greedy repair and optimization operator ...
Using a stochastic model from the existing literature, we analyze two rollout methods that we refer to as the exhaustive rollout and consecutive rollout, both of which employ a simple greedy base policy. We prove that both methods yield a significant improvement in expected performance after a ...