Pages that link to "Item:Q1044419"
From MaRDI portal
The following pages link to Solving the bi-objective multi-dimensional knapsack problem exploiting the concept of core (Q1044419):
Displayed 9 items.
- Dynamic programming algorithms for the bi-objective integer knapsack problem (Q299843) (← links)
- Robust efficiency measures for linear knapsack problem variants (Q323349) (← links)
- Dynamic programming based algorithms for the discounted \(\{0-1\}\) knapsack problem (Q428109) (← links)
- The three-dimensional knapsack problem with balancing constraints (Q440966) (← links)
- Using the idea of expanded core for the exact solution of bi-objective multi-dimensional knapsack problems (Q537958) (← links)
- 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)
- Solving 0-1 knapsack problems based on amoeboid organism algorithm (Q2016352) (← links)
- A reduction dynamic programming algorithm for the bi-objective integer knapsack problem (Q2356097) (← links)
- The multiobjective multidimensional knapsack problem: a survey and a new approach (Q2865172) (← links)