An algorithm for approximating the Pareto set of the multiobjective set covering problem (Q513581)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An algorithm for approximating the Pareto set of the multiobjective set covering problem |
scientific article; zbMATH DE number 6692531
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An algorithm for approximating the Pareto set of the multiobjective set covering problem |
scientific article; zbMATH DE number 6692531 |
Statements
An algorithm for approximating the Pareto set of the multiobjective set covering problem (English)
0 references
7 March 2017
0 references
multiobjective set covering problem
0 references
heuristics
0 references
local branching
0 references
tree-based search
0 references
0 references
0 references
0 references
0.8785413503646851
0 references
0.8697894811630249
0 references
0.8304654359817505
0 references
0.7877309322357178
0 references
0.7877309322357178
0 references
