Pages that link to "Item:Q537958"

The following pages link to Using the idea of expanded core for the exact solution of bi-objective multi-dimensional knapsack problems (Q537958):

Displaying 9 items.

• Dynamic programming algorithms for the bi-objective integer knapsack problem (Q299843) (← links)
• Surrogate upper bound sets for bi-objective bi-dimensional binary knapsack problems (Q319373) (← links)
• Finding all nondominated points of multi-objective integer programs (Q377734) (← links)
• Binary accelerated particle swarm algorithm (BAPSA) for discrete optimization problems (Q377748) (← 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 the bi-objective multi-dimensional knapsack problem exploiting the concept of core (Q1044419) (← links)
• A reduction dynamic programming algorithm for the bi-objective integer knapsack problem (Q2356097) (← links)
• Core problems in bi-criteria \(\{0,1\}\)-knapsack problems (Q2468486) (← links)
• A criterion space search algorithm for biobjective integer programming: the balanced box method (Q2802251) (← links)