Pages that link to "Item:Q2379863"
From MaRDI portal
The following pages link to Two-phase method and Lagrangian relaxation to solve the bi-objective set covering problem (Q2379863):
Displaying 9 items.
- Generation of the exact Pareto set in multi-objective traveling salesman and set covering problems (Q274932) (← links)
- An algorithm for approximating the Pareto set of the multiobjective set covering problem (Q513581) (← 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)
- Interactive polyhedral outer approximation (IPOA) strategy for general multiobjective optimization problems (Q2442076) (← links)
- Evolutionary, constructive and hybrid procedures for the bi-objective set packing problem (Q2655608) (← links)
- Approximating the Pareto frontier for a challenging real-world bi-objective covering problem (Q5883604) (← links)
- Two‐phase strategies for the bi‐objective minimum spanning tree problem (Q6060666) (← links)