Pages that link to "Item:Q2355937"
From MaRDI portal
The following pages link to Advanced greedy algorithms and surrogate constraint methods for linear and quadratic knapsack and covering problems (Q2355937):
Displaying 4 items.
- An improved version of a core based algorithm for the multi-objective multi-dimensional knapsack problem: a computational study and comparison with meta-heuristics (Q670759) (← links)
- A multi-start iterated local search algorithm for the generalized quadratic multiple knapsack problem (Q1652289) (← links)
- An effective dynamic programming algorithm for the minimum-cost maximal knapsack packing problem (Q1683061) (← links)
- High generalization performance structured self-attention model for knapsack problem (Q5025155) (← links)
