An algorithm for approximating the Pareto set of the multiobjective set covering problem
DOI10.1007/S10479-016-2229-XzbMATH Open1357.90126OpenAlexW2400262174MaRDI QIDQ513581FDOQ513581
Authors: Lakmali Weerasena, Margaret M. Wiecek, Banu Soylu 
Publication date: 7 March 2017
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-016-2229-x
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
Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Cites Work
- Reducibility among combinatorial problems
- Title not available (Why is that?)
- Error detecting and error correcting codes
- Multicriteria Optimization
- Local branching
- A survey and annotated bibliography of multiobjective combinatorial optimization
- Two-phase method and Lagrangian relaxation to solve the bi-objective set covering problem
- Generation of the exact Pareto set in multi-objective traveling salesman and set covering problems
- A comparative study of multiple-objective metaheuristics on the bi-objective set covering problem and the Pareto memetic algorithm
- Exploring relaxation induced neighborhoods to improve MIP solutions
- Variable neighborhood search and local branching
- Multi‐objective combinatorial optimization problems: A survey
- Title not available (Why is that?)
- Heuristic approaches for biobjective mixed 0-1 integer linear programming problems
- A Heuristic Method for the 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
- Linearization approach to multi-objective quadratic set covering problem
- An existence result for maximizations with respect to cones
Cited In (14)
- A tolerance function for the multiobjective 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
- Title not available (Why is that?)
- An approximation algorithm for multi-objective optimization problems using a box-coverage
- A comparative study of multiple-objective metaheuristics on the bi-objective set covering problem and the Pareto memetic algorithm
- Approximating the Pareto frontier for a challenging real-world bi-objective covering problem
- Orientational variable-length strip covering problem: a branch-and-price-based algorithm
- A cluster-based immune-inspired algorithm using manifold learning for multimodal multi-objective optimization
- Pareto set approximation by the method of adjustable weights and successive lexicographic goal programming
- Design of a heuristic algorithm for the generalized multi-objective set covering problem
- Advancing local search approximations for multiobjective combinatorial optimization problems
- Dynamic algorithm selection for Pareto optimal set approximation
- Covers and approximations in multiobjective optimization
Uses Software
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)
