Pages that link to "Item:Q702718"
From MaRDI portal
The following pages link to A comparative study of multiple-objective metaheuristics on the bi-objective set covering problem and the Pareto memetic algorithm (Q702718):
Displaying 15 items.
- Generation of the exact Pareto set in multi-objective traveling salesman and set covering problems (Q274932) (← links)
- A multi-objective military system of systems architecting problem with inflexible and flexible systems: formulation and solution methods (Q331779) (← links)
- A Pareto-metaheuristic for a bi-objective winner determination problem in a combinatorial reverse auction (Q336792) (← links)
- Solving a bicriteria problem of optimal service centers location (Q367241) (← links)
- The robust set covering problem with interval data (Q367647) (← links)
- An algorithm for approximating the Pareto set of the multiobjective set covering problem (Q513581) (← links)
- Pareto memetic algorithm for multiple objective optimization with an industrial application (Q945051) (← links)
- Pareto memetic algorithm with path relinking for bi-objective traveling salesperson problem (Q954938) (← links)
- A tolerance function for the multiobjective set covering problem (Q1733317) (← links)
- Design of a heuristic algorithm for the generalized multi-objective set covering problem (Q2149956) (← 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)
- Evolutionary, constructive and hybrid procedures for the bi-objective set packing problem (Q2655608) (← links)
- The multiobjective multidimensional knapsack problem: a survey and a new approach (Q2865172) (← links)
- MEMOTS: a memetic algorithm integrating tabu search for combinatorial multiobjective optimization (Q5456580) (← links)
