Minimum-Cost Shortest-Path Interdiction Problem Involving Upgrading Edges on Trees with Weighted <i>l</i><sub>∞</sub> Norm
Network interdiction problems involving edge deletion on shortest paths have wide applications. However, in many practical scenarios, the complete removal of edges is infeasible. The minimum-cost shortest-path interdiction problem for trees with the weighted <inline-formula><math xmlns="http://www.w...
Збережено в:
| Автори: | , |
|---|---|
| Формат: | Artigo |
| Мова: | Inglês |
| Опубліковано: |
MDPI AG
2025-10-01
|
| Серія: | Mathematics |
| Предмети: | |
| Онлайн доступ: | https://www.mdpi.com/2227-7390/13/19/3219 |
| Теги: |
Немає тегів, Будьте першим, хто поставить тег для цього запису!
|