Pages that link to "Item:Q513581"
From MaRDI portal
The following pages link to An algorithm for approximating the Pareto set of the multiobjective set covering problem (Q513581):
Displaying 13 items.
- Generation of the exact Pareto set in multi-objective traveling salesman and set covering problems (Q274932) (← links)
- Dynamic algorithm selection for Pareto optimal set approximation (Q506461) (← links)
- Covers and approximations in multiobjective optimization (Q513168) (← links)
- Pareto set approximation by the method of adjustable weights and successive lexicographic goal programming (Q691482) (← links)
- A comparative study of multiple-objective metaheuristics on the bi-objective set covering problem and the Pareto memetic algorithm (Q702718) (← links)
- A tolerance function for the multiobjective set covering problem (Q1733317) (← links)
- Orientational variable-length strip covering problem: a branch-and-price-based algorithm (Q2028818) (← links)
- Advancing local search approximations for multiobjective combinatorial optimization problems (Q2125231) (← links)
- An approximation algorithm for multi-objective optimization problems using a box-coverage (Q2141729) (← 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)
- Approximating the Pareto frontier for a challenging real-world bi-objective covering problem (Q5883604) (← links)
- A cluster-based immune-inspired algorithm using manifold learning for multimodal multi-objective optimization (Q6180210) (← links)
