Efficient algorithms for the minmax regret path center problem with length constraint on trees (Q2136270)
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: Efficient algorithms for the minmax regret path center problem with length constraint on trees |
scientific article; zbMATH DE number 7524428
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient algorithms for the minmax regret path center problem with length constraint on trees |
scientific article; zbMATH DE number 7524428 |
Statements
Efficient algorithms for the minmax regret path center problem with length constraint on trees (English)
0 references
10 May 2022
0 references
location theory
0 references
minmax regret optimization
0 references
centers
0 references
path centers
0 references
trees
0 references
0 references
0 references
