The robust minimum spanning tree problem: Compact and convex uncertainty |
| |
| Authors: | Martha Salazar-Neumann |
| |
| Institution: | Service de Mathématiques de la Gestion, Université Libre de Bruxelles, Boulevard du Triomphe - CP 210/01, B-1050 Bruxelles, Belgium |
| |
| Abstract: | We consider the robust minimum spanning tree problem where edges costs are on a compact and convex subset of Rn. We give the location of the robust deviation scenarios for a tree and characterizations of strictly strong edges and non-weak edges leading to recognition algorithms. |
| |
| Keywords: | Minimax regret optimization Robust spanning tree Uncertainty modeling |
| 本文献已被 ScienceDirect 等数据库收录！ |
