The following pages link to MEMOTS (Q15293):
Displayed 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)
- Greedy algorithms for a class of knapsack problems with binary weights (Q1761999) (← links)
- Multi- and many-objective path-relinking: a taxonomy and decomposition approach (Q2668797) (← links)
- The multiobjective multidimensional knapsack problem: a survey and a new approach (Q2865172) (← links)