A linear time algorithm for inverse obnoxious center location problems on networks (Q301046): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10100-012-0248-5 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2000740510 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 01:55, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A linear time algorithm for inverse obnoxious center location problems on networks |
scientific article |
Statements
A linear time algorithm for inverse obnoxious center location problems on networks (English)
0 references
29 June 2016
0 references
obnoxious center location
0 references
combinatorial optimization
0 references
inverse
0 references
optimization
0 references
computational complexity
0 references
