Efficient algorithms for the minmax regret path center problem with length constraint on trees (Q2136270): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 00:18, 2 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient algorithms for the minmax regret path center problem with length constraint on trees |
scientific article |
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
