{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,13]],"date-time":"2023-09-13T17:58:52Z","timestamp":1694627932348},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2006,11,29]],"date-time":"2006-11-29T00:00:00Z","timestamp":1164758400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2006,11,29]],"date-time":"2006-11-29T00:00:00Z","timestamp":1164758400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Constraints"],"published-print":{"date-parts":[[2007,6]]},"DOI":"10.1007\/s10601-006-9006-4","type":"journal-article","created":{"date-parts":[[2006,11,28]],"date-time":"2006-11-28T19:40:54Z","timestamp":1164742854000},"page":"207-238","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Cost-based Filtering for Shorter Path Constraints"],"prefix":"10.1007","volume":"12","author":[{"given":"Meinolf","family":"Sellmann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thorsten","family":"Gellermann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert","family":"Wright","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,11,29]]},"reference":[{"key":"9006_CR1","unstructured":"Ahuja, R.K., Magnati, T.L., & Orlin, J.B. (1993). Network flows. Prentice-Hall."},{"key":"9006_CR2","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. (1983). Shortest chain subject to side conditions. Netw. 13, 295\u2013302.","journal-title":"Netw."},{"key":"#cr-split#-9006_CR3.1","doi-asserted-by":"crossref","unstructured":"Apt, K.R. (1999). The rough guide to constraint propagation. In Principles and Practice of Constraint Programming","DOI":"10.1007\/978-3-540-48085-3_1"},{"key":"#cr-split#-9006_CR3.2","unstructured":"(CP) LNCS 1713, pp 1-23. Springer."},{"key":"9006_CR4","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/s101070050002","volume":"87","author":"F. Barahona","year":"2000","unstructured":"Barahona, F., & Anbil, R. (2000). The volume algorithm: Producing primal solutions with a subgradient algorithm. Math. Program.\n                           87, 385\u2013399.","journal-title":"Math. Program."},{"key":"9006_CR5","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1002\/net.3230190402","volume":"19","author":"J. Beasley","year":"1989","unstructured":"Beasley, J., & Christofides, N. (1989). An algorithm for the resource constrained shortest path problem. Netw.\n                           19, 379\u2013394.","journal-title":"Netw."},{"key":"9006_CR6","unstructured":"Borndoerfer, R., & Loebel, A. (2001). Scheduling Duties by Adaptive Column Generation. Technical Report, Konrad-Zuse-Zentrum fuer Informationstechink Berlin ZIB-01-02."},{"key":"9006_CR7","unstructured":"Cormen, T.H., Leiserson, C.E., & Rivest, R.L. (1993). Introduction to Algorithms. MIT."},{"key":"9006_CR8","first-page":"357","volume":"19","author":"H. Crowder","year":"1976","unstructured":"Crowder, H. (1976). Computational improvements for subgradient optimization. Symp. Math.\n                           19, 357\u2013372.","journal-title":"Symp. Math."},{"key":"9006_CR9","first-page":"35","volume-title":"Handbook in Operations Research and Management Science 8: Network Routing, 8","author":"J. Desrosiers","year":"1995","unstructured":"Desrosiers, J., Dumas, Y., Solomon, M., & Soumis, F. (1995). Time constrained routing and scheduling. In Handbook in Operations Research and Management Science 8: Network Routing, 8, 35\u2013139. Amsterdam, The Netherlands: North Holland."},{"key":"9006_CR10","volume-title":"International Symposium on Mathematical Programming (ISMP)","author":"I. Dumitrescu","year":"2000","unstructured":"Dumitrescu, I., & Boland, N. (2000). The weight-constrained shortest path problem: preprocessing, scaling and dynamic programming algorithms with numerical comparisons. In International Symposium on Mathematical Programming (ISMP). Atlanta, Georgia: Georgia Institute of Technology."},{"issue":"1","key":"9006_CR11","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. (2002). Constraint programming based column generation for crew assignment. J. Heuristics. 8(1), 59\u201381.","journal-title":"J. Heuristics"},{"key":"9006_CR12","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1023\/A:1021193019522","volume":"115","author":"T. Fahle","year":"2002","unstructured":"Fahle, T., & Sellmann, M. (2002). Cost-based filtering for the constrained knapsack problem. Ann. Oper. Res.\n                           115, 73\u201393.","journal-title":"Ann. Oper. Res."},{"key":"#cr-split#-9006_CR13.1","doi-asserted-by":"crossref","unstructured":"Focacci, F., Lodi, A., & Milano, M. (1999). Cost-based domain filtering. In Principles and Practice of Constraint Programming","DOI":"10.1007\/978-3-540-48085-3_14"},{"key":"#cr-split#-9006_CR13.2","unstructured":"(CP) LNCS  1713, pp 189-203. Springer."},{"key":"9006_CR14","doi-asserted-by":"crossref","unstructured":"Focacci, F., Lodi, A., & Milano, M. (2000). Cutting Planes in Constraint Programming: An Hybrid Approach. Technical Report: tr-001-2000, Paderborn Center for Parallel Computing, University of Paderborn, Germany. (CP-AI-OR\u201900, pp 45\u201351.)","DOI":"10.1007\/3-540-45349-0_15"},{"issue":"2","key":"9006_CR15","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/0304-3975(80)90009-2","volume":"10","author":"S. Fortune","year":"1980","unstructured":"Fortune, S., Hopcroft, J., & Wyllie, J. (1980). The directed subgraph homeomorphism problem. Theor. Comp. Sci.\n                           10(2), 111\u2013121.","journal-title":"Theor. Comp. Sci."},{"key":"9006_CR16","unstructured":"Frangioni, A. (1996). 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)"},{"key":"9006_CR17","unstructured":"Frangioni, A. (1997). Dual Ascent Methods and Multicommodity Flow Problems. Doctoral Thesis TD-97-05, Dipartimento di Informatica, Universita di Pisa."},{"key":"9006_CR18","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1145\/28869.28874","volume":"34","author":"M.L. Fredmann","year":"1987","unstructured":"Fredmann, M.L., & Tarjan, R.E. (1987). Fibonacci heaps and their uses in improved network optimization algorithms. J. ACM\n                           34, 596\u2013615.","journal-title":"J. ACM"},{"key":"9006_CR19","unstructured":"Garey, M.R., & Johnson, D.S. (1979). Computers and Intractability, A Guide to the Theory of NP-Completeness. Freeman."},{"key":"9006_CR20","doi-asserted-by":"crossref","unstructured":"Gellermann, T., Sellmann, M., & Wright, R.W. (2005). Shorter path constraints for the resource constrained shortest path problem. In Second International Conference on the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CP-AI-OR) LNCS 3524, pp 201\u2013216. Springer.","DOI":"10.1007\/11493853_16"},{"key":"9006_CR21","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1002\/net.3230100403","volume":"10","author":"G. Handler","year":"1980","unstructured":"Handler, G., Zang, I. (1980). A dual algorithm for the restricted shortest path problem. Netw.\n                           10, 293\u2013310.","journal-title":"Netw."},{"key":"9006_CR22","doi-asserted-by":"crossref","unstructured":"Jahn, O., Moehring, R., & Schulz, A. (1999). Optimal Routing of Traffic Flows with Length Restrictions in Networks with Congestion. Technical Report, TU Berlin. (pp 658\u20131999)","DOI":"10.1007\/978-3-642-58300-1_68"},{"key":"9006_CR23","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/0022-247X(66)90020-5","volume":"14","author":"H. Joksch","year":"1966","unstructured":"Joksch, H. (1966). The shortest route problem with constraints. J. Math. Anal. Appl.\n                           14, 191\u2013197.","journal-title":"J. Math. Anal. Appl."},{"key":"9006_CR24","doi-asserted-by":"crossref","unstructured":"Junker, U., Karisch, S.E., Kohl, N., Vaaben, B., Fahle, T., & Sellmann, M. (1999). A framework for constraint programming based column generation. In Principles and Practice of Constraint Programming (CP), LNCS 1713, pp 261\u2013274. Springer.","DOI":"10.1007\/978-3-540-48085-3_19"},{"key":"9006_CR25","first-page":"703","volume":"8","author":"J.E. Kelley","year":"1960","unstructured":"Kelley, J.E. (1960). The cutting plane method for solving convex programs. J. SIAM.\n                           8, 703\u2013712.","journal-title":"J. SIAM."},{"key":"9006_CR26","first-page":"32","volume":"13","author":"V. Kumar","year":"1992","unstructured":"Kumar, V. (1992). Algorithms for constraints satisfaction problems: a survey. AI Mag.\n                           13, 32\u201344.(AAAI)","journal-title":"AI Mag."},{"key":"9006_CR27","unstructured":"Luebbecke, M., & Zimmermann, U. (2000). Computer aided scheduling of switching engines. CASPT. Springer."},{"key":"9006_CR28","doi-asserted-by":"crossref","unstructured":"Mehlhorn, K., & Ziegelmann, M. (2000). Resource constrained shortest paths. In Proc. 8th European Symposium on Algorithms (ESA) LNCS 1879, pp 326\u2013337. Springer.","DOI":"10.1007\/3-540-45253-2_30"},{"key":"9006_CR29","doi-asserted-by":"crossref","unstructured":"Orda, A. (1998). Routing with end to end QoS guarantees in broadband networks. In Conference on Computer Communications (Infocom), pp 27\u201334. IEEE.","DOI":"10.1109\/INFCOM.1998.659634"},{"key":"9006_CR30","unstructured":"Ottosson, G., & Thorsteinsson, E.S. (2000). Linear Relaxation and Reduced-cost Based Propagation of Continuous Variable Subscripts. Technical Report, Paderborn Center for Parallel Computing. (tr-001-2000,CP-AI-OR\u201900, pp 129\u2013138)"},{"key":"9006_CR31","unstructured":"Pettie, S., & Ramachandran, V. (2002). Computing undirected shortest paths using comparisons and additions. In ACM-SIAM Symposium on Discrete Algorithms, pp 267\u2013276. Society for Industrial and Applied Mathematics. (January)."},{"key":"#cr-split#-9006_CR32.1","doi-asserted-by":"crossref","unstructured":"R\u00e9gin, J.C. (1999). Arc consistency for global cardinality constraints with costs. In Principles and Practice of Constraint Programming","DOI":"10.1007\/978-3-540-48085-3_28"},{"key":"#cr-split#-9006_CR32.2","unstructured":"(CP) LNCS 1713, pp 390-404. Springer."},{"key":"9006_CR33","doi-asserted-by":"crossref","unstructured":"Sellmann, M. (2002a). An arc-consistency algorithm for the weighted all different constraint. In Principles and Practice of Constraint Programming (CP) LNCS 2470, pp 744\u2013749. Springer.","DOI":"10.1007\/3-540-46135-3_56"},{"key":"9006_CR34","doi-asserted-by":"crossref","unstructured":"Sellmann, M. (2003). Cost-based filtering for shorter path constraints. In Principles and Practice of Constraint Programming (CP) LNCS, 2833, pp 679\u2013693. Springer.","DOI":"10.1007\/978-3-540-45193-8_46"},{"key":"9006_CR35","doi-asserted-by":"crossref","unstructured":"Sellmann, M. (2004). Theoretical foundations of CP-based Lagrangian relaxation. In Principles and Practice of Constraint Programming (CP) LNCS 3258, pp 634\u2013647. Springer.","DOI":"10.1007\/978-3-540-30201-8_46"},{"key":"9006_CR36","doi-asserted-by":"crossref","unstructured":"Sellmann, M., & Fahle, T. (2001). Coupling variable fixing algorithms for the automatic recording problem. In Annual European Symposium on Algorithms (ESA) LNCS 2161, pp 134\u2013145. Springer.","DOI":"10.1007\/3-540-44676-1_11"},{"key":"9006_CR37","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1023\/A:1021845304798","volume":"118","author":"M. Sellmann","year":"2003","unstructured":"Sellmann, M., & Fahle, T. (2003). Constraint programming based lagrangian relaxation for the automatic recording problem. Ann. Oper. Res.\n                           118, 17\u201333.","journal-title":"Ann. Oper. Res."},{"key":"9006_CR38","doi-asserted-by":"crossref","unstructured":"Thorup, M. (1997). Undirected single source shortest paths in linear time. In Annual Symposium on Foundations of Computer Science (FOCS), pp 12\u201321. IEEE Computer Society.","DOI":"10.1109\/SFCS.1997.646088"},{"key":"9006_CR39","unstructured":"Xue, G. (2000). Primal-dual algorithms for computing weight-constrained shortest paths and weight-constrained minimum spanning trees. In International Performance, Computing, and Communications Conference (IPCCC), pp 271\u2013277. IEEE."},{"key":"9006_CR40","doi-asserted-by":"crossref","unstructured":"Yunes, T.H., Moura, A.V., & Souza, C.C. (2000). A hybrid approach for solving large crew scheduling problems. In International Workshop on Practical Aspects of Declarative Languages (PADL) LNCS 1753, pp 293\u2013307. Springer.","DOI":"10.1007\/3-540-46584-7_20"}],"container-title":["Constraints"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-006-9006-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10601-006-9006-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-006-9006-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-006-9006-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,17]],"date-time":"2022-05-17T22:01:26Z","timestamp":1652824886000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10601-006-9006-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,11,29]]},"references-count":43,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2007,6]]}},"alternative-id":["9006"],"URL":"https:\/\/doi.org\/10.1007\/s10601-006-9006-4","relation":{},"ISSN":["1383-7133","1572-9354"],"issn-type":[{"value":"1383-7133","type":"print"},{"value":"1572-9354","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,11,29]]},"assertion":[{"value":"30 September 2005","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 August 2006","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 September 2006","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 November 2006","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}