Mathematical Programming Algorithms for Two-Path Routing Problems with Reliability Considerations

Most traditional routing problems assume perfect operability of all arcs and nodes. However, when independent arc failure probabilities exist, a secondary objective must be present to retain some measure of expected functionality, introducing nonlinear, nonconvex constraints. We examine the robust t...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	INFORMS journal on computing Ročník 20; číslo 4; s. 553 - 564
Hlavní autori:	Andreas, April K, Smith, J. Cole
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Linthicum INFORMS 22.09.2008 Institute for Operations Research and the Management Sciences
Predmet:	Advantages Algorithms Analysis branch and bound Branch and bound algorithms Graph theory graphs integer Mathematical optimization Mathematical programming networks nonlinear programming Routing Studies theory United States
ISSN:	1091-9856, 1526-5528, 1091-9856
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!