Pages that link to "Item:Q947962"
From MaRDI portal
The following pages link to Solving efficiently the 0-1 multi-objective knapsack problem (Q947962):
Displaying 9 items.
- Enumeration of the Nondominated Set of Multiobjective Discrete Optimization Problems (Q4995057) (← links)
- Approximation Methods for Multiobjective Optimization Problems: A Survey (Q5084597) (← links)
- Network Models for Multiobjective Discrete Optimization (Q5086002) (← links)
- Solving 0 - 1 knapsack problem by artificial chemical reaction optimization algorithm with a greedy strategy (Q5298457) (← links)
- Computational Science - ICCS 2004 (Q5712553) (← links)
- Computing efficiently the nondominated subset of a set sum (Q6080591) (← links)
- Ordinal optimization through multi-objective reformulation (Q6096566) (← links)
- Augmenting bi-objective branch and bound by scalarization-based information (Q6616273) (← links)
- Parallel implementation of an exact two-phase method for the biobjective knapsack problem (Q6658451) (← links)