Pages that link to "Item:Q1733317"
From MaRDI portal
The following pages link to A tolerance function for the multiobjective set covering problem (Q1733317):
Displaying 8 items.
- Covers and approximations in multiobjective optimization (Q513168) (← links)
- An algorithm for approximating the Pareto set of the multiobjective set covering problem (Q513581) (← 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)
- Variable and large neighborhood search to solve the multiobjective set covering problem (Q2359157) (← links)
- Network Models for Multiobjective Discrete Optimization (Q5086002) (← links)
- Approximating the Pareto frontier for a challenging real-world bi-objective covering problem (Q5883604) (← links)