An algorithm for approximating the Pareto set of the multiobjective set covering problem (Q513581): Difference between revisions
From MaRDI portal
Normalize DOI. |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/S10479-016-2229-X / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S10479-016-2229-X / rank | |||
Normal rank | |||
Latest revision as of 20:01, 9 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An algorithm for approximating the Pareto set of the multiobjective set covering problem |
scientific article |
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
