Branch-and-price-and-cut algorithms for solving the reliable h-paths problem

Journal of Global Optimization

Volumn 42, Issue 4, 2008, Pages 443-466

  Andreas, April K ^a   Smith, J Cole ^b   Küçükyavuz, Simge ^a  

^a University of Arizona   (United States)

^b University of Florida   (United States)

Author keywords

Branch and price and cut; Network optimization; Nonconvex optimization; Reliability

Indexed keywords

CAVITY RESONATORS; COMPUTER NETWORKS; COSTS; MATHEMATICAL MODELS; NETWORK PROTOCOLS; OPTIMIZATION; PROBABILITY; RELIABILITY; SENSOR NETWORKS;

BRANCH-AND-PRICE-AND-CUT; COMPUTATIONAL RESULTS; COST SETS; FEASIBLE REGIONS; INDEPENDENT FAILURES; INTEGER PROGRAMMING FORMULATIONS; INTEGER VARIABLES; NETWORK OPTIMIZATION; NONCONVEX; NONCONVEX OPTIMIZATION; PATH PROBLEMS; PATH ROUTING; PATHS PROBLEMS; RELIABILITY CONSTRAINTS; RELIABLE H; ROUTING PROBLEMS;

INTEGER PROGRAMMING;

EID: 54949117240     PISSN: 09255001     EISSN: 15732916     Source Type: Journal    
DOI: 10.1007/s10898-007-9254-x     Document Type: Article

References (24)

1. Andreas, A.K.: Mathematical programming algorithms for robust routing and evacuation problems. PhD thesis. Department of Systems and Industrial Engineering, The University of Arizona, Tucson, Arizona (2006)
2. Andreas, A.K., Smith, J.C.: Mathematical programming algorithms for two-path routing problems with reliability considerations. Working Paper, Department of Systems and Industrial Engineering, The University of Arizona, Tucson, Arizona (2006)
3. J.F. Bard J.L. Miller 1989 Probabilistic shortest path problems with budgetary constraints Comput. Oper. Res. 16 2 145 159
4. C. Barnhart C.A. Hane E.L. Johnson G. Sigismondi 1995 A column generation and partitioning approach for multi-commodity flow problems Telecommun. Syst. 3 239 258
5. C. Barnhart C.A. Hane P.H. Vance 2000 Using branch-and-price-and-cut to solve origin-destination integer multicommodity flow problems Oper. Res. 48 2 318 326
6. Chen Z.L. and Powell W.B. (1998). A generalized threshold algorithm for the shortest path problem with time windows. In: Pardalos, P.M. and Du, D.-Z. (eds) Network Design: Connectivity and Facilities Location, Discrete Mathematics and Theoretical Computer Science, pp 303-318. American Mathematical Society, Providence, RI
7. M. Desrochers F. Soumis 1988 A generalized permanent labelling algorithm for the shortest path problem with time windows INFOR 26 3 191 212
8. Desrosiers J., Dumas Y., Solomon M.M. and Soumis F. (1995). Time constrained routing and scheduling. In: Ball, M.O., Magnanti, T.L., Monma, C.L., and Nemhauser, G.L. (eds) Network Routing, volume 8 of Handbooks in Operations Research and Management Science, pp 35-139. Elsevier, Amsterdam
9. E.W. Dijkstra 1959 A note on two problems in connexion with graphs Numerische Mathematik 1 269 271
10. I. Dumitrescu N. Boland 2001 Algorithms for the weight constrained shortest path problem Int. Trans. Oper. Res. 8 15 29
11. I. Dumitrescu N. Boland 2003 Improved preprocessing, labeling and scaling algorithms for the weight-constrained shortest path problem Networks 42 3 135 153
12. A.A. Elimam D. Kohler 1997 Case study: Two engineering applications of a constrained shortest-path model Eur. J. Oper. Res. 103 426 438
13. J.E. Falk R.M. Soland 1969 An algorithm for separable nonconvex programming problems Manage. Sci. 15 550 569
14. S. Fortune J. Hopcroft J. Wyllie 1980 The directed subgraph homeomorphism problem Theor. Comp. Sci. 10 111 121
15. F. Glover R. Glover D. Klingman 1984 The threshold shortest path problem Networks 14 25 36
16. M.E. Lübbecke J. Desrosiers 2005 Selected topics in column generation Oper. Res. 53 6 1007 1023
17. H.D. Sherali J.C. Smith 2001 Improving discrete model representations via symmetry considerations Manage. Sci. 47 10 1396 1407
18. H.D. Sherali C.H. Tuncbilek 1992 A global optimization algorithm for polynomial programming problems using a Reformulation-Linearization Technique J. Global Optim. 2 101 112
19. J.W. Suurballe 1974 Disjoint paths in a network Networks 4 125 145
20. Vanderbeck, F.: Decomposition and column generation for integer programs. PhD thesis, Université Catholique de Louvain, Belgium (1994)
21. Vanderbeck, F.: Branching in branch-and-price: a generic scheme. Working Paper, Applied Mathematics, University Bordeaux 1, F-33405 Talence Cedex, France (2006)
22. F. Vanderbeck L.A. Wolsey 1996 An exact algorithm for IP column generation Oper. Res. Lett. 19 151 159
23. W.E. Wilhelm 2001 A technical review of column generation in integer programming Optim. Eng. 2 159 200
24. Zabarankin M., Uryasev S. and Pardalos P.M. (2002). Optimal risk path algorithms. In: Murphey, R. and Pardalos, P.M. (eds) Cooperative Control and Optimization, pp 273-303. Kluwer Academic Publishers, Boston