A tolerance function for the multiobjective set covering problem

DOI10.1007/s11590-018-1267-5zbMath1417.90131OpenAlexW2802300968MaRDI QIDQ1733317

Lakmali Weerasena, Margaret M. Wiecek

Publication date: 21 March 2019

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-018-1267-5

zbMATH Keywords

combinatorial optimizationrepresentationapproximation algorithmefficient solutionapproximation errorMAX-ordering

Mathematics Subject Classification ID

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

Related Items (4)

Advancing local search approximations for multiobjective combinatorial optimization problems ⋮ Design of a heuristic algorithm for the generalized multi-objective set covering problem ⋮ Network Models for Multiobjective Discrete Optimization ⋮ Orientational variable-length strip covering problem: a branch-and-price-based algorithm

Uses Software

• GitHub
• vOptLib

Cites Work

• Unnamed Item
• Generation of the exact Pareto set in multi-objective traveling salesman and set covering problems
• Covers and approximations in multiobjective optimization
• An algorithm for approximating the Pareto set of the multiobjective set covering problem
• A survey of very large-scale neighborhood search techniques
• 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
• Approximating the Pareto curve with local search for the bicriteria TSP(1,2) problem
• 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
• Approximating Multiobjective Knapsack Problems
• A Greedy Heuristic for the Set-Covering Problem
• Linearization approach to multi-objective quadratic set covering problem
• 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: A tolerance function for the multiobjective set covering problem