Efficient algorithms for the minmax regret path center problem with length constraint on trees (Q2136270): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.tcs.2022.03.017 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.TCS.2022.03.017 / rank | |||
Normal rank | |||
Latest revision as of 05:02, 17 December 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
0 references
0 references
