{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,16]],"date-time":"2026-10-16T06:16:51Z","timestamp":1792131411645,"version":"4.4.0"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540261520","type":"print"},{"value":"9783540322641","type":"electronic"}],"license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11493853_16","type":"book-chapter","created":{"date-parts":[[2010,7,14]],"date-time":"2010-07-14T03:35:25Z","timestamp":1279078525000},"page":"201-216","source":"Crossref","is-referenced-by-count":11,"title":["Shorter Path Constraints for the Resource Constrained Shortest Path Problem"],"prefix":"10.1007","author":[{"given":"Thorsten","family":"Gellermann","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Meinolf","family":"Sellmann","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Robert","family":"Wright","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"16_CR1","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1002\/net.3230130212","volume":"13","author":"Y. Aneja","year":"1983","unstructured":"Aneja, Y., Aggarwal, V., Nair, K.: Shortest chain subject to side conditions. Networks\u00a013, 295\u2013302 (1983)","journal-title":"Networks"},{"key":"16_CR2","doi-asserted-by":"crossref","unstructured":"Applegate, D., Bixby, R., Chv\u00e1tal, V., Cook, W.: On the solution of Traveling Salesman Problems. Doc. Math. J. DMV, Extra Volume ICM III, 645\u2013656 (1998)","DOI":"10.4171\/dms\/1-3\/62"},{"key":"16_CR3","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/s101070050002","volume":"87","author":"F. Barahona","year":"2000","unstructured":"Barahona, F., Anbil, R.: The Volume Algorithm: producing primal solutions with a subgradient algorithm. Mathematical Programming\u00a087, 385\u2013399 (2000)","journal-title":"Mathematical Programming"},{"key":"16_CR4","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1002\/net.3230190402","volume":"19","author":"J. Beasley","year":"1989","unstructured":"Beasley, J., Christofides, N.: An Algorithm for the Resource Constrained Shortest Path Problem. Networks\u00a019, 379\u2013394 (1989)","journal-title":"Networks"},{"key":"16_CR5","unstructured":"Crowder, H.: Computational improvements for subgradient optimization. Symposia Mathematica\u00a0XIX, 357\u2013372 (1976)"},{"key":"16_CR6","first-page":"35","volume-title":"Handbook in Operations Research and Management Science 8: Network Routing","author":"J. Desrosiers","year":"1995","unstructured":"Desrosiers, J., Dumas, Y., Solomon, M., Soumis, F.: Time Constrained Routing and Scheduling. In: Handbook in Operations Research and Management Science 8: Network Routing, vol.\u00a08, pp. 35\u2013139. North-Holland, Amsterdam (1995)"},{"key":"16_CR7","unstructured":"Dumitrescu, I., Boland, N.: The weight-constrained shortest path problem: preprocessing, scaling and dynamic programming algorithms with numerical comparisons. In: International Symposium on Mathematical Programming, ISMP (2000)"},{"issue":"1","key":"16_CR8","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1023\/A:1013613701606","volume":"8","author":"T. Fahle","year":"2002","unstructured":"Fahle, T., Junker, U., Karisch, S.E., Kohl, N., Sellmann, M., Vaaben, B.: Constraint programming based column generation for crew assignment. Journal of Heuristics\u00a08(1), 59\u201381 (2002)","journal-title":"Journal of Heuristics"},{"key":"16_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/978-3-540-48085-3_14","volume-title":"Principles and Practice of Constraint Programming \u2013 CP\u201999","author":"F. Focacci","year":"1999","unstructured":"Focacci, F., Lodi, A., Milano, M.: Cost-Based Domain Filtering. In: Jaffar, J. (ed.) CP 1999. LNCS, vol.\u00a01713, pp. 189\u2013203. Springer, Heidelberg (1999)"},{"key":"16_CR10","unstructured":"Frangioni, A.: A Bundle type Dual-ascent Approach to Linear Multi-Commodity Min Cost Flow Problems. Technical Report, Dipartimento di Informatica, Universita di Pisa, TR-96-01 (1996)"},{"key":"16_CR11","unstructured":"Frangioni, A.: Dual Ascent Methods and Multicommodity Flow Problems. Doctoral Thesis, Dipartimento di Informatica, Universita di Pisa, TD-97-05 (1997)"},{"key":"16_CR12","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1002\/net.3230100403","volume":"10","author":"G. Handler","year":"1980","unstructured":"Handler, G., Zang, I.: A Dual Algorithm for the Restricted Shortest Path Problem. Networks\u00a010, 293\u2013310 (1980)","journal-title":"Networks"},{"key":"16_CR13","first-page":"703","volume":"8","author":"J.E. Kelley","year":"1960","unstructured":"Kelley, J.E.: The Cutting Plane Method for Solving Convex Programs. Journal of the SIAM\u00a08, 703\u2013712 (1960)","journal-title":"Journal of the SIAM"},{"key":"16_CR14","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1287\/ijoc.1020.0026","volume":"16","author":"A. Makri","year":"2004","unstructured":"Makri, A., Klabjan, D.: A New Pricing Scheme for Airline Crew Scheduling. INFORMS Journal on Computing\u00a016, 56\u201367 (2004)","journal-title":"INFORMS Journal on Computing"},{"key":"16_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1007\/3-540-45253-2_30","volume-title":"Algorithms - ESA 2000","author":"K. Mehlhorn","year":"2000","unstructured":"Mehlhorn, K., Ziegelmann, M.: Resource Constrained Shortest Paths. In: Paterson, M. (ed.) ESA 2000. LNCS, vol.\u00a01879, pp. 326\u2013337. Springer, Heidelberg (2000)"},{"key":"16_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1007\/978-3-540-30201-8_46","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2004","author":"M. Sellmann","year":"2004","unstructured":"Sellmann, M.: Theoretical Foundations of CP-Based Lagrangian Relaxation. In: Wallace, M. (ed.) CP 2004. LNCS, vol.\u00a03258, pp. 634\u2013647. Springer, Heidelberg (2004)"},{"key":"16_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"679","DOI":"10.1007\/978-3-540-45193-8_46","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2003","author":"M. Sellmann","year":"2003","unstructured":"Sellmann, M.: Cost-Based Filtering for Shorter Path Constraints. In: Rossi, F. (ed.) CP 2003. LNCS, vol.\u00a02833, pp. 679\u2013693. Springer, Heidelberg (2003)"},{"key":"16_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/3-540-44676-1_11","volume-title":"Algorithms - ESA 2001","author":"M. Sellmann","year":"2001","unstructured":"Sellmann, M., Fahle, T.: Coupling Variable Fixing Algorithms for the Automatic Recording Problem. In: Meyer auf der Heide, F. (ed.) ESA 2001. LNCS, vol.\u00a02161, pp. 134\u2013145. Springer, Heidelberg (2001)"},{"key":"16_CR19","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1023\/A:1021845304798","volume":"118","author":"M. Sellmann","year":"2003","unstructured":"Sellmann, M., Fahle, T.: Constraint Programming Based Lagrangian Relaxation for the Automatic Recording Problem. Annals of Operations Research\u00a0118, 17\u201333 (2003)","journal-title":"Annals of Operations Research"},{"key":"16_CR20","volume-title":"Monographs on Discrete Mathematics and Applications","author":"P. Toth","year":"2001","unstructured":"Toth, P., Vigo, D.: The Vehicle Routing Problem. In: Monographs on Discrete Mathematics and Applications. SIAM, Philadelphia (2001)"}],"container-title":["Lecture Notes in Computer Science","Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11493853_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,1]],"date-time":"2023-06-01T22:37:22Z","timestamp":1685659042000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11493853_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540261520","9783540322641"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/11493853_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}