Pages that link to "Item:Q1876139"
From MaRDI portal
The following pages link to On the computational efficiency of multiple objective metaheuristics. The knapsack problem case study (Q1876139):
Displaying 18 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)
- Robust optimization of the 0-1 knapsack problem: balancing risk and return in assortment optimization (Q322574) (← links)
- MOTGA: a multiobjective Tchebycheff based genetic algorithm for the multidimensional knapsack problem (Q883311) (← links)
- A multiobjective metaheuristic for a mean-risk static stochastic knapsack problem (Q989843) (← links)
- Experiments concerning sequential versus simultaneous maximization of objective function and distance (Q1009194) (← links)
- Labeling algorithms for multiple objective integer knapsack problems (Q1040971) (← links)
- Solving multiobjective, multiconstraint knapsack problems using mathematical programming and evolutionary algorithms (Q1043327) (← links)
- Differential evolution with improved sub-route reversal repair mechanism for multiobjective urban transit routing problem (Q1713245) (← links)
- Lorenz dominance based algorithms to solve a practical multiobjective problem (Q1725590) (← links)
- A heuristic approach for allocation of data to RFID tags: a data allocation knapsack problem (DAKP) (Q1761954) (← 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 reduction dynamic programming algorithm for the bi-objective integer knapsack problem (Q2356097) (← links)
- An empirical study on similarity-based mating for evolutionary multiobjective combinatorial optimization (Q2469583) (← links)
- MOAQ and ant-Q algorithm for multiple objective optimization problems (Q2573012) (← links)
- The multiobjective multidimensional knapsack problem: a survey and a new approach (Q2865172) (← links)
- Convergence speed in multi-objective metaheuristics: Efficiency criteria and empirical study (Q3062625) (← links)
- Implementation of Multiobjective Memetic Algorithms for Combinatorial Optimization Problems: A Knapsack Problem Case Study (Q3627774) (← links)
