Combinatorial algorithms for some variants of inverse obnoxious median location problem on tree networks (Q1730835)
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: Combinatorial algorithms for some variants of inverse obnoxious median location problem on tree networks |
scientific article; zbMATH DE number 7032764
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Combinatorial algorithms for some variants of inverse obnoxious median location problem on tree networks |
scientific article; zbMATH DE number 7032764 |
Statements
Combinatorial algorithms for some variants of inverse obnoxious median location problem on tree networks (English)
0 references
6 March 2019
0 references
obnoxious median location
0 references
combinatorial optimization
0 references
inverse optimization
0 references
time complexity
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.96316195
0 references
0.9367492
0 references
0.9289375
0 references
0 references
0.9027924
0 references
0.8997406
0 references
0.89304954
0 references
0.89164364
0 references
0.8903885
0 references
