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...

Full description

Saved in:

Bibliographic Details
Published in:	INFORMS journal on computing Vol. 20; no. 4; pp. 553 - 564
Main Authors:	Andreas, April K, Smith, J. Cole
Format:	Journal Article
Language:	English
Published:	Linthicum INFORMS 22.09.2008 Institute for Operations Research and the Management Sciences
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!