Pages that link to "Item:Q2359157"
From MaRDI portal
The following pages link to Variable and large neighborhood search to solve the multiobjective set covering problem (Q2359157):
Displaying 13 items.
- Generation of the exact Pareto set in multi-objective traveling salesman and set covering problems (Q274932) (← links)
- ILP heuristics and a new exact method for bi-objective 0/1 ILPs: application to fttx-network design (Q342390) (← links)
- An algorithm for approximating the Pareto set of the multiobjective set covering problem (Q513581) (← links)
- A comparative study of multiple-objective metaheuristics on the bi-objective set covering problem and the Pareto memetic algorithm (Q702718) (← links)
- Exploring further advantages in an alternative formulation for the set covering problem (Q783157) (← links)
- A variable neighborhood search algorithm for the multimode set covering problem (Q887195) (← links)
- Many-objective Pareto local search (Q1653381) (← links)
- A tolerance function for the multiobjective set covering problem (Q1733317) (← links)
- A parallel variable neighborhood search for solving covering salesman problem (Q2070124) (← links)
- Design of a heuristic algorithm for the generalized multi-objective set covering problem (Q2149956) (← links)
- Two-phase method and Lagrangian relaxation to solve the bi-objective set covering problem (Q2379863) (← links)
- Proper balance between search towards and along Pareto front: biobjective TSP case study (Q2400011) (← links)
- Approximating the Pareto frontier for a challenging real-world bi-objective covering problem (Q5883604) (← links)
