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 5 items.
- 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)
- Design of a heuristic algorithm for the generalized multi-objective set covering problem (Q2149956) (← links)
- A cluster-based immune-inspired algorithm using manifold learning for multimodal multi-objective optimization (Q6180210) (← links)
