An algorithm for approximating the Pareto set of the multiobjective set covering problem

DOI10.1007/S10479-016-2229-XMaRDI QIDQ513581zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

heuristicslocal branchingmultiobjective set covering problemtree-based search

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

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

• scientific article; zbMATH DE number 4085440 (Why is no real title available?)
• scientific article; zbMATH DE number 1550909 (Why is no real title available?)
• A Heuristic Method for the Set Covering Problem
• 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 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
• 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

(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
• scientific article; zbMATH DE number 834594 (Why is no real title available?)
• 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
• Pareto set approximation by the method of adjustable weights and successive lexicographic goal programming
• A cluster-based immune-inspired algorithm using manifold learning for multimodal multi-objective optimization
• 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

Describes a project that uses

Uses Software

• CPLEX

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)