An algorithm for approximating the Pareto set of the multiobjective set covering problem (Q513581): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10479-016-2229-x / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2400262174 / rank | |||
Normal rank | |||
Revision as of 22:18, 19 March 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
