A tolerance function for the multiobjective set covering problem
type: Item
instance of: scholarly article
title: A tolerance function for the multiobjective set covering problem
zbMATH Open document ID: 1417.90131
author: Lakmali Weerasena
author: Margaret M. Wiecek
published in: Optimization Letters
publication date: 2019-03-21T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C29
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 7040046
zbMATH Keywords: approximation algorithm
zbMATH Keywords: approximation error
zbMATH Keywords: representation
zbMATH Keywords: combinatorial optimization
zbMATH Keywords: efficient solution
zbMATH Keywords: MAX-ordering
describes a project that uses: vOptLib
describes a project that uses: GitHub
MaRDI profile type: Publication
full work available at URL: s11590-018-1267-5
OpenAlex ID: W2802300968
cites work: A survey of very large-scale neighborhood search techniques
cites work: Approximating the Pareto curve with local search for the bicriteria TSP(1,2) problem
cites work: A Heuristic Method for the Set Covering Problem
cites work: A Greedy Heuristic for the Set-Covering Problem
cites work: Multicriteria Optimization
cites work: A survey and annotated bibliography of multiobjective combinatorial optimization
cites work: Approximating Multiobjective Knapsack Problems
cites work: Generation of the exact Pareto set in multi-objective traveling salesman and set covering problems
cites work: A comparative study of multiple-objective metaheuristics on the bi-objective set covering problem and the Pareto memetic algorithm
cites work: Reducibility among Combinatorial Problems
cites work: A heuristic algorithm for the multi-criteria set-covering problems
cites work: Variable and large neighborhood search to solve the multiobjective set covering problem
cites work: Q3056948
cites work: Two-phase method and Lagrangian relaxation to solve the bi-objective set covering problem
cites work: Linearization approach to multi-objective quadratic set covering problem
cites work: Multi‐objective combinatorial optimization problems: A survey
cites work: Covers and approximations in multiobjective optimization
cites work: An algorithm for approximating the Pareto set of the multiobjective set covering problem
DOI: 10.1007/S11590-018-1267-5
description: scientific article; zbMATH DE number 7040046