{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:37:27Z","timestamp":1759667847893},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2007,10,30]],"date-time":"2007-10-30T00:00:00Z","timestamp":1193702400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2008,12]]},"DOI":"10.1007\/s10898-007-9254-x","type":"journal-article","created":{"date-parts":[[2007,10,29]],"date-time":"2007-10-29T13:06:43Z","timestamp":1193663203000},"page":"443-466","source":"Crossref","is-referenced-by-count":16,"title":["Branch-and-price-and-cut algorithms for solving the reliable h-paths problem"],"prefix":"10.1007","volume":"42","author":[{"given":"April K.","family":"Andreas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J. Cole","family":"Smith","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Simge","family":"K\u00fc\u00e7\u00fckyavuz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,10,30]]},"reference":[{"key":"9254_CR1","unstructured":"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)"},{"key":"9254_CR2","unstructured":"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)"},{"issue":"2","key":"9254_CR3","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/0305-0548(89)90016-6","volume":"16","author":"J.F. Bard","year":"1989","unstructured":"Bard J.F. and Miller J.L. (1989). Probabilistic shortest path problems with budgetary constraints. Comput. Oper. Res. 16(2): 145\u2013159","journal-title":"Comput. Oper. Res."},{"key":"9254_CR4","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/BF02110307","volume":"3","author":"C. Barnhart","year":"1995","unstructured":"Barnhart C., Hane C.A., Johnson E.L. and Sigismondi G. (1995). A column generation and partitioning approach for multi-commodity flow problems. Telecommun. Syst. 3: 239\u2013258","journal-title":"Telecommun. Syst."},{"issue":"2","key":"9254_CR5","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1287\/opre.48.2.318.12378","volume":"48","author":"C. Barnhart","year":"2000","unstructured":"Barnhart C., Hane C.A. and Vance P.H. (2000). Using branch-and-price-and-cut to solve origin-destination integer multicommodity flow problems. Oper. Res. 48(2): 318\u2013326","journal-title":"Oper. Res."},{"key":"9254_CR6","first-page":"303","volume-title":"Network Design: Connectivity and Facilities Location, Discrete Mathematics and Theoretical Computer Science","author":"Z.L. Chen","year":"1998","unstructured":"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\u2013318. American Mathematical Society, Providence, RI"},{"issue":"3","key":"9254_CR7","first-page":"191","volume":"26","author":"M. Desrochers","year":"1988","unstructured":"Desrochers M. and Soumis F. (1988). A generalized permanent labelling algorithm for the shortest path problem with time windows. INFOR 26(3): 191\u2013212","journal-title":"INFOR"},{"key":"9254_CR8","first-page":"35","volume-title":"Network Routing, volume 8 of Handbooks in Operations Research and Management Science","author":"J. Desrosiers","year":"1995","unstructured":"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\u2013139. Elsevier, Amsterdam"},{"key":"9254_CR9","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"E.W. Dijkstra","year":"1959","unstructured":"Dijkstra E.W. (1959). A note on two problems in connexion with graphs. Numerische Mathematik 1: 269\u2013271","journal-title":"Numerische Mathematik"},{"key":"9254_CR10","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1111\/1475-3995.00003","volume":"8","author":"I. Dumitrescu","year":"2001","unstructured":"Dumitrescu I. and Boland N. (2001). Algorithms for the weight constrained shortest path problem. Int. Trans. Oper. Res. 8: 15\u201329","journal-title":"Int. Trans. Oper. Res."},{"issue":"3","key":"9254_CR11","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1002\/net.10090","volume":"42","author":"I. Dumitrescu","year":"2003","unstructured":"Dumitrescu I. and Boland N. (2003). Improved preprocessing, labeling and scaling algorithms for the weight-constrained shortest path problem. Networks 42(3): 135\u2013153","journal-title":"Networks"},{"key":"9254_CR12","doi-asserted-by":"crossref","first-page":"426","DOI":"10.1016\/S0377-2217(97)00149-5","volume":"103","author":"A.A. Elimam","year":"1997","unstructured":"Elimam A.A. and Kohler D. (1997). Case study: Two engineering applications of a constrained shortest-path model. Eur. J. Oper. Res. 103: 426\u2013438","journal-title":"Eur. J. Oper. Res."},{"key":"9254_CR13","doi-asserted-by":"crossref","first-page":"550","DOI":"10.1287\/mnsc.15.9.550","volume":"15","author":"J.E. Falk","year":"1969","unstructured":"Falk J.E. and Soland R.M. (1969). An algorithm for separable nonconvex programming problems. Manage. Sci. 15: 550\u2013569","journal-title":"Manage. Sci."},{"key":"9254_CR14","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/0304-3975(80)90009-2","volume":"10","author":"S. Fortune","year":"1980","unstructured":"Fortune S., Hopcroft J. and Wyllie J. (1980). The directed subgraph homeomorphism problem. Theor. Comp. Sci. 10: 111\u2013121","journal-title":"Theor. Comp. Sci."},{"key":"9254_CR15","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1002\/net.3230140103","volume":"14","author":"F. Glover","year":"1984","unstructured":"Glover F., Glover R. and Klingman D. (1984). The threshold shortest path problem. Networks 14: 25\u201336","journal-title":"Networks"},{"issue":"6","key":"9254_CR16","doi-asserted-by":"crossref","first-page":"1007","DOI":"10.1287\/opre.1050.0234","volume":"53","author":"M.E. L\u00fcbbecke","year":"2005","unstructured":"L\u00fcbbecke M.E. and Desrosiers J. (2005). Selected topics in column generation. Oper. Res. 53(6): 1007\u20131023","journal-title":"Oper. Res."},{"issue":"10","key":"9254_CR17","doi-asserted-by":"crossref","first-page":"1396","DOI":"10.1287\/mnsc.47.10.1396.10265","volume":"47","author":"H.D. Sherali","year":"2001","unstructured":"Sherali H.D. and Smith J.C. (2001). Improving discrete model representations via symmetry considerations. Manage. Sci. 47(10): 1396\u20131407","journal-title":"Manage. Sci."},{"key":"9254_CR18","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/BF00121304","volume":"2","author":"H.D. Sherali","year":"1992","unstructured":"Sherali H.D. and Tuncbilek C.H. (1992). A global optimization algorithm for polynomial programming problems using a Reformulation-Linearization Technique. J. Global Optim. 2: 101\u2013112","journal-title":"J. Global Optim."},{"key":"9254_CR19","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1002\/net.3230040204","volume":"4","author":"J.W. Suurballe","year":"1974","unstructured":"Suurballe J.W. (1974). Disjoint paths in a network. Networks 4: 125\u2013145","journal-title":"Networks"},{"key":"9254_CR20","unstructured":"Vanderbeck, F.: Decomposition and column generation for integer programs. PhD thesis, Universit\u00e9 Catholique de Louvain, Belgium (1994)"},{"key":"9254_CR21","unstructured":"Vanderbeck, F.: Branching in branch-and-price: a generic scheme. Working Paper, Applied Mathematics, University Bordeaux 1, F-33405 Talence Cedex, France (2006)"},{"key":"9254_CR22","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/0167-6377(96)00033-8","volume":"19","author":"F. Vanderbeck","year":"1996","unstructured":"Vanderbeck F. and Wolsey L.A. (1996). An exact algorithm for IP column generation. Oper. Res. Lett. 19: 151\u2013159","journal-title":"Oper. Res. Lett."},{"key":"9254_CR23","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1023\/A:1013141227104","volume":"2","author":"W.E. Wilhelm","year":"2001","unstructured":"Wilhelm W.E. (2001). A technical review of column generation in integer programming. Optim. Eng. 2: 159\u2013200","journal-title":"Optim. Eng."},{"key":"9254_CR24","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1007\/0-306-47536-7_13","volume-title":"Cooperative Control and Optimization","author":"M. Zabarankin","year":"2002","unstructured":"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\u2013303. Kluwer Academic Publishers, Boston"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-007-9254-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-007-9254-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-007-9254-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T12:12:10Z","timestamp":1559304730000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-007-9254-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,10,30]]},"references-count":24,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2008,12]]}},"alternative-id":["9254"],"URL":"https:\/\/doi.org\/10.1007\/s10898-007-9254-x","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,10,30]]}}}