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

DOI10.1007/s10479-016-2229-xzbMath1357.90126OpenAlexW2400262174MaRDI QIDQ513581

Lakmali Weerasena, Banu Soylu, Margaret M. Wiecek

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)

Related Items (5)

Advancing local search approximations for multiobjective combinatorial optimization problems ⋮ Design of a heuristic algorithm for the generalized multi-objective set covering problem ⋮ A cluster-based immune-inspired algorithm using manifold learning for multimodal multi-objective optimization ⋮ A tolerance function for the multiobjective set covering problem ⋮ Orientational variable-length strip covering problem: a branch-and-price-based algorithm

Uses Software

• CPLEX

Cites Work

• Unnamed Item
• Unnamed Item
• 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
• A comparative study of multiple-objective metaheuristics on the bi-objective set covering problem and the Pareto memetic algorithm
• An existence result for maximizations with respect to cones
• A heuristic algorithm for the multi-criteria set-covering problems
• Local branching
• Exploring relaxation induced neighborhoods to improve MIP solutions
• A survey and annotated bibliography of multiobjective combinatorial optimization
• Variable and large neighborhood search to solve the multiobjective set covering problem
• Two-phase method and Lagrangian relaxation to solve the bi-objective set covering problem
• Variable neighborhood search and local branching
• Linearization approach to multi-objective quadratic set covering problem
• Error Detecting and Error Correcting Codes
• Multi‐objective combinatorial optimization problems: A survey
• A Heuristic Method for the Set Covering Problem
• Reducibility among Combinatorial Problems
• Multicriteria Optimization

This page was built for publication: An algorithm for approximating the Pareto set of the multiobjective set covering problem