{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T07:54:12Z","timestamp":1725954852616},"publisher-location":"Cham","reference-count":42,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319232188"},{"type":"electronic","value":"9783319232195"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-23219-5_41","type":"book-chapter","created":{"date-parts":[[2015,8,12]],"date-time":"2015-08-12T06:17:33Z","timestamp":1439360253000},"page":"592-608","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":25,"title":["Solving Segment Routing Problems with Hybrid Constraint Programming Techniques"],"prefix":"10.1007","author":[{"given":"Renaud","family":"Hartert","sequence":"first","affiliation":[]},{"given":"Pierre","family":"Schaus","sequence":"additional","affiliation":[]},{"given":"Stefano","family":"Vissicchio","sequence":"additional","affiliation":[]},{"given":"Olivier","family":"Bonaventure","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,8,13]]},"reference":[{"key":"41_CR1","doi-asserted-by":"crossref","unstructured":"Awduche, D., Chiu, A., Elwalid, A., Widjaja, I., Xiao, X.: Overview and principles of internet traffic engineering-rfc3272. IETF (2002)","DOI":"10.17487\/rfc3272"},{"issue":"2","key":"41_CR2","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1287\/opre.48.2.318.12378","volume":"48","author":"C Barnhart","year":"2000","unstructured":"Barnhart, C., Hane, C.A., Vance, P.H.: Using branch-and-price-and-cut to solve origin-destination integer multicommodity flow problems. Operations Research 48(2), 318\u2013326 (2000)","journal-title":"Operations Research"},{"issue":"4","key":"41_CR3","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1002\/net.3230190402","volume":"19","author":"JE Beasley","year":"1989","unstructured":"Beasley, J.E., Christofides, N.: An algorithm for the resource constrained shortest path problem. Networks 19(4), 379\u2013394 (1989)","journal-title":"Networks"},{"issue":"4","key":"41_CR4","doi-asserted-by":"publisher","first-page":"875","DOI":"10.1016\/j.cor.2004.08.001","volume":"33","author":"R Bent","year":"2006","unstructured":"Bent, R., Hentenryck, P.V.: A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows. Computers & Operations Research 33(4), 875\u2013893 (2006)","journal-title":"Computers & Operations Research"},{"issue":"1\u20134","key":"41_CR5","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1145\/176454.176484","volume":"2","author":"P Briggs","year":"1993","unstructured":"Briggs, P., Torczon, L.: An efficient representation for sparse sets. ACM Letters on Programming Languages and Systems (LOPLAS) 2(1\u20134), 59\u201369 (1993)","journal-title":"ACM Letters on Programming Languages and Systems (LOPLAS)"},{"key":"41_CR6","series-title":"Power Systems","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-642-25215-0_1","volume-title":"The Common Information Model CIM","author":"M Uslar","year":"2012","unstructured":"Uslar, M., Specht, M., Rohjans, S., Trefke, J., Gonzalez, J.M.V.: Introduction. In: Uslar, M., Specht, M., Rohjans, S., Trefke, J., Vasquez Gonzalez, J.M. (eds.) The Common Information Model CIM. POWSYS, vol. 2, pp. 3\u201348. Springer, Heidelberg (2012)"},{"key":"41_CR7","unstructured":"Davie, B., Rekhter, Y.: MPLS: technology and applications. Morgan Kaufmann Publishers Inc. (2000)"},{"key":"41_CR8","unstructured":"le Cl\u00e9ment de Saint-Marcq, V., Schaus, P., Solnon, C., Lecoutre, C.: Sparse-sets for domain implementation. In: CP workshop on Techniques for Implementing Constraint programming Systems (TRICS), pp. 1\u201310 (2013)"},{"key":"41_CR9","doi-asserted-by":"crossref","unstructured":"Desrochers, M., Soumis, F.: A generalized permanent labeling algorithm for the shortest path problem with time windows. INFOR Information Systems and Operational Research (1988)","DOI":"10.1080\/03155986.1988.11732063"},{"key":"41_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/11564751_18","volume-title":"Principles and Practice of Constraint Programming - CP 2005","author":"G Dooms","year":"2005","unstructured":"Dooms, G., Deville, Y., Dupont, P.E.: CP(Graph): Introducing a Graph Computation Domain in Constraint Programming. In: van Beek, P. (ed.) CP 2005. LNCS, vol. 3709, pp. 211\u2013225. Springer, Heidelberg (2005)"},{"key":"41_CR11","doi-asserted-by":"crossref","unstructured":"Figueiredo, G.B., da Fonseca, N.L.S., Monteiro, J.A.S.: A minimum interference routing algorithm. In: ICC, pp. 1942\u20131947 (2004)","DOI":"10.1109\/ICC.2004.1312859"},{"key":"41_CR12","doi-asserted-by":"crossref","unstructured":"Filsfils, C., et al.: Segment Routing Architecture. Internet draft, draft-filsfils-spring-segment-routing-00, work in progress (2014)","DOI":"10.1109\/GLOCOM.2014.7417124"},{"key":"41_CR13","unstructured":"Filsfils, C., et al.: Segment Routing Use Cases. Internet draft, draft-filsfils-spring-segment-routing-use-cases-00, work in progress (2014)"},{"key":"41_CR14","unstructured":"Filsfils, C., et al.: Segment Routing with MPLS data plane. Internet draft, draft-filsfils-spring-segment-routing-mpls-01, work in progress (2014)"},{"key":"41_CR15","unstructured":"Fortz, B., Thorup, M.: Internet traffic engineering by optimizing OSPF weights. In: Proc. INFOCOM (March 2000)"},{"key":"41_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1007\/978-3-540-48085-3_15","volume-title":"Principles and Practice of Constraint Programming \u2013 CP\u201999","author":"C Frei","year":"1999","unstructured":"Frei, C., Faltings, B.V.: Resource Allocation in Networks Using Abstraction and Constraint Satisfaction Techniques. In: Jaffar, J. (ed.) CP 1999. LNCS, vol. 1713, pp. 204\u2013218. Springer, Heidelberg (1999)"},{"key":"41_CR17","first-page":"339","volume":"94","author":"C Gervet","year":"1994","unstructured":"Gervet, C.: Conjunto: Constraint logic programming with finite set domains. ILPS 94, 339\u2013358 (1994)","journal-title":"ILPS"},{"issue":"4","key":"41_CR18","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1287\/inte.20.4.74","volume":"20","author":"F Glover","year":"1990","unstructured":"Glover, F.: Tabu search: A tutorial. Interfaces 20(4), 74\u201394 (1990)","journal-title":"Interfaces"},{"key":"41_CR19","unstructured":"Inc., Gurobi Optimization. Gurobi optimizer reference manual (2015)"},{"key":"41_CR20","unstructured":"Kodialam, M., Lakshman, T.V.: Minimum interference routing with applications to mpls traffic engineering. In: Proceedings of the Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies, INFOCOM 2000, vol. 2, pp. 884\u2013893. IEEE (2000)"},{"key":"41_CR21","unstructured":"Mairy, J.B., Deville, Y., Van Hentenryck, P.: Reinforced adaptive large neighborhood search. In: The Seventeenth International Conference on Principles and Practice of Constraint Programming (CP 2011), p. 55 (2011)"},{"key":"41_CR22","doi-asserted-by":"crossref","unstructured":"Nucci, A., Papagiannaki, K.: Design, Measurement and Management of Large-Scale IP Networks - Bridging the Gap between Theory and Practice. Cambridge University Press (2008)","DOI":"10.1017\/CBO9780511791369"},{"key":"41_CR23","unstructured":"RFC3031 \u0152TF. Multiprotocol label switching architecture (2001)"},{"key":"41_CR24","unstructured":"OscaR Team. OscaR: Scala in OR (2012). https:\/\/bitbucket.org\/oscarlib\/oscar"},{"issue":"3","key":"41_CR25","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1002\/net.10110","volume":"43","author":"W Ouaja","year":"2004","unstructured":"Ouaja, W., Richards, B.: A hybrid multicommodity routing algorithm for traffic engineering. Networks 43(3), 125\u2013140 (2004)","journal-title":"Networks"},{"key":"41_CR26","unstructured":"Pacino, D., Van Hentenryck, P.: Large neighborhood search and adaptive randomized decompositions for flexible jobshop scheduling. In: Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence, vol. 3, pp. 1997\u20132002. AAAI Press (2011)"},{"key":"41_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"468","DOI":"10.1007\/978-3-540-30201-8_35","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2004","author":"P Shaw","year":"2004","unstructured":"Shaw, P., Furnon, V.: Propagation Guided Large Neighborhood Search. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 468\u2013481. Springer, Heidelberg (2004)"},{"key":"41_CR28","unstructured":"Previdi, S., et al.: IPv6 Segment Routing Header (SRH). Internet draft, draft-previdi-6man-segment-routing-header-00, work in progress (2014)"},{"key":"41_CR29","unstructured":"Quinn, P., Nadeau, T.: Service function chaining problem statement. draft-ietf-sfc-problem-statement-07 (work in progress) (2014)"},{"key":"41_CR30","unstructured":"Quoitin, B., Van den Schrieck, V., Francois, P., Bonaventure, O.: IGen: Generation of router-level Internet topologies through network design heuristics. In: ITC (2009)"},{"key":"41_CR31","unstructured":"Deering, S.: RFC2460 and R Hinden. Internet protocol"},{"issue":"4","key":"41_CR32","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1287\/trsc.1050.0135","volume":"40","author":"S Ropke","year":"2006","unstructured":"Ropke, S., Pisinger, D.: An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transportation Science 40(4), 455\u2013472 (2006)","journal-title":"Transportation Science"},{"key":"41_CR33","unstructured":"Giralt, L.R., Creemers, T., Tourouta, E., Colomer, J.R., et al.: A global constraint model for integrated routeing and scheduling on a transmission network (2001)"},{"key":"41_CR34","unstructured":"Rossi, F., Van Beek, P., Walsh, T.: Handbook of constraint programming. Elsevier Science (2006)"},{"issue":"5","key":"41_CR35","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1145\/1096536.1096551","volume":"35","author":"M Roughan","year":"2005","unstructured":"Roughan, M.: Simplifying the synthesis of internet traffic matrices. SIGCOMM Comput. Commun. Rev. 35(5), 93\u201396 (2005)","journal-title":"SIGCOMM Comput. Commun. Rev."},{"key":"41_CR36","doi-asserted-by":"crossref","unstructured":"Schaus, P.: Variable objective large neighborhood search (Submitted to CP13, 2013)","DOI":"10.1007\/978-3-642-40627-0_46"},{"key":"41_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1007\/978-3-642-40627-0_46","volume-title":"Principles and Practice of Constraint Programming","author":"P Schaus","year":"2013","unstructured":"Schaus, P., Hartert, R.: Multi-Objective Large Neighborhood Search. In: Schulte, C. (ed.) CP 2013. LNCS, vol. 8124, pp. 611\u2013627. Springer, Heidelberg (2013)"},{"key":"41_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/3-540-49481-2_30","volume-title":"Principles and Practice of Constraint Programming - CP98","author":"P Shaw","year":"1998","unstructured":"Shaw, P.: Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems. In: Maher, M.J., Puget, J.-F. (eds.) CP 1998. LNCS, vol. 1520, pp. 417\u2013431. Springer, Heidelberg (1998)"},{"key":"41_CR39","doi-asserted-by":"publisher","first-page":"875","DOI":"10.1016\/S1574-6526(06)80029-5","volume":"2","author":"H Simonis","year":"2006","unstructured":"Simonis, H.: Constraint applications in networks. Handbook of Constraint Programming 2, 875\u2013903 (2006)","journal-title":"Handbook of Constraint Programming"},{"key":"41_CR40","doi-asserted-by":"crossref","unstructured":"Spring, N., Mahajan, R., Wetherall, D., Anderson, T.: Measuring isp topologies with rocketfuel. IEEE\/ACM Trans. Netw., 12(1) (2004)","DOI":"10.1109\/TNET.2003.822655"},{"issue":"2","key":"41_CR41","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/0004-3702(92)90020-X","volume":"57","author":"P Van Hentenryck","year":"1992","unstructured":"Van Hentenryck, P., Deville, Y., Teng, C.-M.: A generic arc-consistency algorithm and its specializations. Artificial Intelligence 57(2), 291\u2013321 (1992)","journal-title":"Artificial Intelligence"},{"key":"41_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1007\/978-3-540-31956-6_72","volume-title":"Networking - ICN 2005","author":"Q Xia","year":"2005","unstructured":"Xia, Q., Simonis, H.: Primary\/Secondary Path Generation Problem: Reformulation, Solutions and Comparisons. In: Lorenz, P., Dini, P. (eds.) ICN 2005. LNCS, vol. 3420, pp. 611\u2013619. Springer, Heidelberg (2005)"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-23219-5_41","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,8]],"date-time":"2023-02-08T09:27:52Z","timestamp":1675848472000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-23219-5_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319232188","9783319232195"],"references-count":42,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-23219-5_41","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"13 August 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}