Pages that link to "Item:Q2865172"
From MaRDI portal
The following pages link to The multiobjective multidimensional knapsack problem: a survey and a new approach (Q2865172):
Displayed 8 items.
- Anytime Pareto local search (Q319099) (← links)
- Surrogate upper bound sets for bi-objective bi-dimensional binary knapsack problems (Q319373) (← links)
- Robust efficiency measures for linear knapsack problem variants (Q323349) (← links)
- Choquet optimal set in biobjective combinatorial optimization (Q336494) (← links)
- Multi-objective variable neighborhood search: an application to combinatorial optimization problems (Q887201) (← links)
- An improved version of the augmented \(\varepsilon\)-constraint method (AUGMECON2) for finding the exact Pareto set in multi-objective integer programming problems (Q2016277) (← links)
- A Criterion Space Search Algorithm for Biobjective Integer Programming: The Balanced Box Method (Q2802251) (← links)
- A Decentralized Heuristic for Multiple-Choice Combinatorial Optimization Problems (Q5171816) (← links)