
Advanced greedy algorithms and surrogate constraint methods for linear and quadratic knapsack and covering problems
Keywords: محدودیت های باقیمانده; Metaheuristics; Greedy algorithms; Knapsack/covering problems; Surrogate constraints; Multi-start/strategic oscillation; Tabu search