Pages that link to "Item:Q2865172"

The following pages link to The multiobjective multidimensional knapsack problem: a survey and a new approach (Q2865172):

Displaying 27 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)
• 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)
• Multi-objective variable neighborhood search: an application to combinatorial optimization problems (Q887201) (← links)
• Many-objective Pareto local search (Q1653381) (← links)
• A cooperative swarm intelligence algorithm for multi-objective discrete optimization with application to the Knapsack problem (Q1694319) (← links)
• Bridging game theory and the knapsack problem: a theoretical formulation (Q1990251) (← 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)
• The binary knapsack problem with qualitative levels (Q2029032) (← links)
• The multiple multidimensional knapsack with family-split penalties (Q2029273) (← links)
• Learning-based multi-objective evolutionary algorithm for batching decision problem (Q2108120) (← links)
• Knapsack problems -- an overview of recent advances. I: Single knapsack problems (Q2147010) (← links)
• Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems (Q2147011) (← links)
• Variable and large neighborhood search to solve the multiobjective set covering problem (Q2359157) (← links)
• Proper balance between search towards and along Pareto front: biobjective TSP case study (Q2400011) (← links)
• Optimal selection of touristic packages based on user preferences during sports mega-events (Q2672108) (← links)
• A Criterion Space Search Algorithm for Biobjective Integer Programming: The Balanced Box Method (Q2802251) (← links)
• Network Models for Multiobjective Discrete Optimization (Q5086002) (← links)
• Approximate and exact merging of knapsack constraints with cover inequalities (Q5151546) (← links)
• A Decentralized Heuristic for Multiple-Choice Combinatorial Optimization Problems (Q5171816) (← links)
• Systematic reviews as a metaknowledge tool: caveats and a review of available options (Q6056869) (← links)
• Balancing the profit and capacity under uncertainties: a target‐based distributionally robust knapsack problem (Q6091423) (← links)
• Ordinal optimization through multi-objective reformulation (Q6096566) (← links)
• Literature reviews in operations research: a new taxonomy and a meta review (Q6106580) (← links)
• A decomposition approach for multidimensional knapsacks with family‐split penalties (Q6195028) (← links)