An algorithm for approximating the Pareto set of the multiobjective set covering problem
From MaRDI portal
(Redirected from Publication:513581)
Recommendations
- Design of a heuristic algorithm for the generalized multi-objective set covering problem
- A tolerance function for the multiobjective set covering problem
- Variable and large neighborhood search to solve the multiobjective set covering problem
- A heuristic algorithm for the multi-criteria set-covering problems
- Approximating the Pareto frontier for a challenging real-world bi-objective covering problem
Cites work
- A comparative study of multiple-objective metaheuristics on the bi-objective set covering problem and the Pareto memetic algorithm
- A heuristic algorithm for the multi-criteria set-covering problems
- A Heuristic Method for the Set Covering Problem
- A survey and annotated bibliography of multiobjective combinatorial optimization
- An existence result for maximizations with respect to cones
- Error detecting and error correcting codes
- Exploring relaxation induced neighborhoods to improve MIP solutions
- Generation of the exact Pareto set in multi-objective traveling salesman and set covering problems
- Heuristic approaches for biobjective mixed 0-1 integer linear programming problems
- scientific article; zbMATH DE number 4085440 (Why is no real title available?)
- scientific article; zbMATH DE number 1550909 (Why is no real title available?)
- Linearization approach to multi-objective quadratic set covering problem
- Local branching
- Multicriteria Optimization
- Multi‐objective combinatorial optimization problems: A survey
- Reducibility among combinatorial problems
- Two-phase method and Lagrangian relaxation to solve the bi-objective set covering problem
- Variable and large neighborhood search to solve the multiobjective set covering problem
- Variable neighborhood search and local branching
Cited in
(15)- A tolerance function for the multiobjective set covering problem
- Orientational variable-length strip covering problem: a branch-and-price-based algorithm
- Advancing local search approximations for multiobjective combinatorial optimization problems
- An approximation algorithm for multi-objective optimization problems using a box-coverage
- Design of a heuristic algorithm for the generalized multi-objective set covering problem
- Variable and large neighborhood search to solve the multiobjective set covering problem
- Generation of the exact Pareto set in multi-objective traveling salesman and set covering problems
- scientific article; zbMATH DE number 834594 (Why is no real title available?)
- Dynamic algorithm selection for Pareto optimal set approximation
- Covers and approximations in multiobjective optimization
- Approximating the Pareto frontier for a challenging real-world bi-objective covering problem
- A cluster-based immune-inspired algorithm using manifold learning for multimodal multi-objective optimization
- Advances in the decision-making of set covering models under uncertainty
- Pareto set approximation by the method of adjustable weights and successive lexicographic goal programming
- A comparative study of multiple-objective metaheuristics on the bi-objective set covering problem and the Pareto memetic algorithm
This page was built for publication: An algorithm for approximating the Pareto set of the multiobjective set covering problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q513581)
