{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,21]],"date-time":"2026-05-21T00:24:16Z","timestamp":1779323056329,"version":"3.51.4"},"reference-count":54,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2011,2,2]],"date-time":"2011-02-02T00:00:00Z","timestamp":1296604800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2012,4]]},"DOI":"10.1007\/s10479-010-0828-5","type":"journal-article","created":{"date-parts":[[2011,2,1]],"date-time":"2011-02-01T16:19:35Z","timestamp":1296577175000},"page":"71-87","source":"Crossref","is-referenced-by-count":41,"title":["A branch-and-cut procedure for\u00a0the\u00a0Udine Course Timetabling problem"],"prefix":"10.1007","volume":"194","author":[{"given":"Edmund K.","family":"Burke","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jakub","family":"Mare\u010dek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrew J.","family":"Parkes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hana","family":"Rudov\u00e1","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,2,2]]},"reference":[{"key":"828_CR1","volume-title":"Network flows: theory, algorithms, and applications","author":"R.\u00a0K. Ahuja","year":"1993","unstructured":"Ahuja, R.\u00a0K., Magnanti, T.\u00a0L., & Orlin, J.\u00a0B. (1993). Network flows: theory, algorithms, and applications. New York: Prentice Hall."},{"issue":"3","key":"828_CR2","doi-asserted-by":"crossref","first-page":"1028","DOI":"10.1016\/j.ejor.2006.04.035","volume":"180","author":"S.\u00a0M. Al-Yakoob","year":"2007","unstructured":"Al-Yakoob, S.\u00a0M., & Sherali, H.\u00a0D. (2007). A mixed-integer programming approach to a class timetabling problem: a\u00a0case study with gender policies and traffic considerations. European Journal of Operational Research, 180(3), 1028\u20131044.","journal-title":"European Journal of Operational Research"},{"issue":"6","key":"828_CR3","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1007\/s10951-005-4780-1","volume":"8","author":"P. Avella","year":"2005","unstructured":"Avella, P., & Vasil\u2019ev, I. (2005). A computational study of a cutting plane algorithm for university course timetabling. Journal of Scheduling, 8(6), 497\u2013514.","journal-title":"Journal of Scheduling"},{"issue":"2","key":"828_CR4","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1007\/s10107-003-0432-4","volume":"99","author":"E. Balas","year":"2004","unstructured":"Balas, E., Bockmayr, A., Pisaruk, N., & Wolsey, L. (2004). On unions and dominants of polytopes. Mathematical Programming, 99(2), 223\u2013239.","journal-title":"Mathematical Programming"},{"issue":"1","key":"828_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0166-218X(93)90164-J","volume":"43","author":"E. Balas","year":"1993","unstructured":"Balas, E., & Qi, L. Q. (1993). Linear-time separation algorithms for the three-index assignment polytope. Discrete Applied Mathematics, 43(1), 1\u201312.","journal-title":"Discrete Applied Mathematics"},{"key":"828_CR6","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/0166-218X(89)90014-0","volume":"23","author":"E. Balas","year":"1989","unstructured":"Balas, E., & Saltzman, M. J. (1989). Facets of the three-index assignment polytope. Discrete Applied Mathematics, 23, 201\u2013229.","journal-title":"Discrete Applied Mathematics"},{"issue":"1","key":"828_CR7","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1287\/opre.39.1.150","volume":"39","author":"E. Balas","year":"1991","unstructured":"Balas, E., & Saltzman, M. J. (1991). An algorithm for the three-index assignment problem. Operations Research, 39(1), 150\u2013161.","journal-title":"Operations Research"},{"key":"828_CR8","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1007\/3-540-61794-9_50","volume-title":"Practice and theory of automated timetabling","author":"V. A. Bardadym","year":"1996","unstructured":"Bardadym, V. A. (1996). Computer-aided school and university timetabling: the new wave. In E. K. Burke & P. Ross (Eds.), Lecture notes in computer science: Vol. 1153. Practice and theory of automated timetabling (pp. 22\u201345). Berlin: Springer."},{"issue":"1","key":"828_CR9","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1057\/palgrave.jors.2602523","volume":"60","author":"C. B. Beyrouthy","year":"2009","unstructured":"Beyrouthy, C. B., Burke, E. K., Silva, D. L., McCollum, B., McMullan, P., & Parkes, A. J. (2009). Towards improving the utilisation of university teaching space. The Journal of the Operational Research Society, 60(1), 130\u2013143.","journal-title":"The Journal of the Operational Research Society"},{"key":"828_CR10","doi-asserted-by":"crossref","unstructured":"Bonutti, A., De Cesco, F., Di Gaspero, L., & Schaerf, A. (2011). Benchmarking curriculum-based course timetabling: formulations, data formats, instances, validation, visualization, and results. Annals of Operations Research (this volume). doi: 10.1007\/s10479-010-0707-0 .","DOI":"10.1007\/s10479-010-0707-0"},{"issue":"2","key":"828_CR11","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1016\/S0377-2217(02)00069-3","volume":"140","author":"E. K. Burke","year":"2002","unstructured":"Burke, E. K., & Petrovic, S. (2002). Recent research directions in automated timetabling. European Journal of Operational Research, 140(2), 266\u2013280.","journal-title":"European Journal of Operational Research"},{"issue":"9","key":"828_CR12","doi-asserted-by":"crossref","first-page":"565","DOI":"10.1093\/comjnl\/40.9.565","volume":"40","author":"E. K. Burke","year":"1997","unstructured":"Burke, E. K., Jackson, K., Kingston, J. H., & Weare, R. F. (1997). Automated university timetabling: the state of the art. Computer Journal, 40(9), 565\u2013571.","journal-title":"Computer Journal"},{"key":"828_CR13","first-page":"445","volume-title":"Handbook of graph theory","author":"E. K. Burke","year":"2004","unstructured":"Burke, E. K., de Werra, D., & Kingston, J. H. (2004). Applications to timetabling. In J. L. Gross & J. Yellen (Eds.), Handbook of graph theory (pp. 445\u2013474). London: CRC."},{"issue":"1","key":"828_CR14","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/s10479-010-0716-z","volume":"179","author":"E. K. Burke","year":"2010","unstructured":"Burke, E. K., Mare\u010dek, J., Parkes, A. J., & Rudov\u00e1, H. (2010). A supernodal formulation of vertex colouring with applications in course timetabling. Annals of Operations Research 179(1), 105\u2013130.","journal-title":"Annals of Operations Research"},{"key":"828_CR15","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1007\/978-3-540-77903-2_63","volume-title":"Operations research proceedings 2007","author":"E. K. Burke","year":"2008","unstructured":"Burke, E. K., Mare\u010dek, J., Parkes, A. J., & Rudov\u00e1, H. (2008). Penalising patterns in timetables: novel integer programming formulations. In S. Nickel & J. Kalcsics (Eds.), Operations research proceedings 2007 (pp. 409\u2013414). Berlin: Springer."},{"issue":"1","key":"828_CR16","doi-asserted-by":"crossref","first-page":"582","DOI":"10.1016\/j.cor.2009.02.023","volume":"37","author":"E. K. Burke","year":"2010","unstructured":"Burke, E. K., Mare\u010dek, J., Parkes, A. J., & Rudov\u00e1, H. (2010). Decomposition, reformulation, and diving in timetabling. Computers and Operations Research, 37(1), 582\u2013597.","journal-title":"Computers and Operations Research"},{"issue":"4","key":"828_CR17","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/j.ipl.2003.11.005","volume":"89","author":"M. Camp\u00ealo","year":"2003","unstructured":"Camp\u00ealo, M., Corr\u00eaa, R. C., & Frota, Y. (2003). Cliques, holes and the vertex coloring polytope. Information Processing Letters, 89(4), 159\u2013164.","journal-title":"Information Processing Letters"},{"issue":"1\u20133","key":"828_CR18","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/S0166-218X(98)00046-8","volume":"87","author":"A. Caprara","year":"1998","unstructured":"Caprara, A. (1998). Properties of some ILP formulations of a class of partitioning problems. Discrete Applied Mathematics, 87(1\u20133), 11\u201323.","journal-title":"Discrete Applied Mathematics"},{"key":"828_CR19","first-page":"230","volume":"27","author":"M. W. Carter","year":"1989","unstructured":"Carter, M. W. (1989). A Lagrangian relaxation approach to the classroom assignment problem. INFORMS Journal on Computing, 27, 230\u2013245.","journal-title":"INFORMS Journal on Computing"},{"key":"828_CR20","series-title":"Lecture notes in computer science","first-page":"3","volume-title":"Practice and theory of automated timetabling","author":"M. W. Carter","year":"1997","unstructured":"Carter, M. W., & Laporte, G. (1997). Recent developments in practical course timetabling. In E. K. Burke & M. W. Carter (Eds.), Lecture notes in computer science: Vol. 1408. Practice and theory of automated timetabling (pp. 3\u201319). Berlin: Springer."},{"key":"828_CR21","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/0012-365X(73)90167-2","volume":"4","author":"V. Chv\u00e1tal","year":"1973","unstructured":"Chv\u00e1tal, V. (1973). Edmonds polytopes and a hierarchy of combinatorial problems. Discrete Mathematics, 4, 305\u2013337.","journal-title":"Discrete Mathematics"},{"key":"828_CR22","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1023\/A:1021315911306","volume":"116","author":"P. Coll","year":"2002","unstructured":"Coll, P., Marenco, J., M\u00e9ndez-D\u00edaz, I., & Zabala, P. (2002). Facets of the graph coloring polytope. Annals of Operations Research, 116, 79\u201390.","journal-title":"Annals of Operations Research"},{"key":"828_CR23","first-page":"986","volume-title":"SODA \u201907: Proceedings of the eighteenth annual ACM-SIAM symposium on discrete algorithms","author":"A. Czumaj","year":"2007","unstructured":"Czumaj, A., & Lingas, A. (2007). Finding a heaviest triangle is not harder than matrix multiplication. In SODA \u201907: Proceedings of the eighteenth annual ACM-SIAM symposium on discrete algorithms (pp.\u00a0986\u2013994). Philadelphia: SIAM."},{"key":"828_CR24","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/S0377-2217(03)00103-6","volume":"153","author":"S. Daskalaki","year":"2004","unstructured":"Daskalaki, S., Birbas, T., & Housos, E. (2004). An integer programming formulation for a case study in university timetabling. European Journal of Operational Research, 153, 117\u2013135.","journal-title":"European Journal of Operational Research"},{"key":"828_CR25","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1016\/j.ejor.2003.06.023","volume":"160","author":"S. Daskalaki","year":"2005","unstructured":"Daskalaki, S., Birbas, T., & Housos, E. (2005). Efficient solutions for a university timetabling problem through integer programming. European Journal of Operational Research, 160, 106\u2013120.","journal-title":"European Journal of Operational Research"},{"key":"828_CR26","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1016\/S0377-2217(03)00104-8","volume":"153","author":"M. Dimopoulou","year":"2004","unstructured":"Dimopoulou, M., & Miliotis, P. (2004). An automated university course timetabling system developed in a distributed environment: a\u00a0case study. European Journal of Operational Research, 153, 136\u2013147.","journal-title":"European Journal of Operational Research"},{"key":"828_CR27","doi-asserted-by":"crossref","first-page":"125","DOI":"10.6028\/jres.069B.013","volume":"69B","author":"J. Edmonds","year":"1965","unstructured":"Edmonds, J. (1965). Maximum matching and a polyhedron with 0,1-vertices. Journal of Research, National Bureau of Standards. Section D, Radio Science, 69B, 125\u2013130.","journal-title":"Journal of Research, National Bureau of Standards. Section D, Radio Science"},{"issue":"3","key":"828_CR28","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/BF02579233","volume":"2","author":"J. Edmonds","year":"1982","unstructured":"Edmonds, J., Lov\u00e1sz, L., & Pulleyblank, W. R. (1982). Brick decompositions and the matching rank of graphs. Combinatorica, 2(3), 247\u2013274.","journal-title":"Combinatorica"},{"key":"828_CR29","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1007\/978-3-540-45157-0_17","volume-title":"Practice and theory of automated timetabling","author":"L. Gaspero Di","year":"2003","unstructured":"Di Gaspero, L., & Schaerf, A. (2003). Multi neighborhood local search with application to the course timetabling problem. In E. K. Burke & P. De Causmaecker (Eds.), Lecture notes in computer science: Vol. 2740. Practice and theory of automated timetabling (pp. 262\u2013275). Berlin: Springer."},{"issue":"1","key":"828_CR30","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/s10852-005-9032-z","volume":"5","author":"L. Gaspero Di","year":"2006","unstructured":"Di Gaspero, L., & Schaerf, A. (2006). Neighborhood portfolio approach for local search applied to timetabling problems. Journal of Mathematical Modelling and Algorithms, 5(1), 65\u201389.","journal-title":"Journal of Mathematical Modelling and Algorithms"},{"key":"828_CR31","first-page":"67","volume":"6","author":"G. Gwan","year":"1992","unstructured":"Gwan, G., & Qi, L. Q. (1992). On facets of the three-index assignment polytope. The Australasian Journal of Combinatorics, 6, 67\u201387.","journal-title":"The Australasian Journal of Combinatorics"},{"key":"828_CR32","volume-title":"ILOG CPLEX advanced programming techniques","author":"ILOG","year":"2006","unstructured":"ILOG (2006). ILOG CPLEX advanced programming techniques. Incline Village: ILOG S. A."},{"key":"828_CR33","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1007\/978-3-540-68552-4_18","volume-title":"Experimental algorithms","author":"G. Lach","year":"2008","unstructured":"Lach, G., & L\u00fcbbecke, M. E. (2008). Optimal university course timetables and the partial transversal polytope. In C. C. McGeoch (Ed.), Lecture notes in computer science: Vol. 5038. Experimental algorithms (pp. 235\u2013248). Berlin: Springer."},{"key":"828_CR34","doi-asserted-by":"crossref","unstructured":"Lach, G., & L\u00fcbbecke, M. E. (2011). Curriculum based course timetabling: new solutions to Udine benchmark instances. Annals of Operations Research (this volume). doi: 10.1007\/s10479-010-0700-7 .","DOI":"10.1007\/s10479-010-0700-7"},{"key":"828_CR35","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1093\/comjnl\/12.4.307","volume":"12","author":"N. L. Lawrie","year":"1969","unstructured":"Lawrie, N. L. (1969). An integer linear programming model of a school timetabling problem. Computer Journal, 12, 307\u2013316.","journal-title":"Computer Journal"},{"key":"828_CR36","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/978-3-540-77345-0_1","volume-title":"Practice and theory of automated timetabling","author":"B. McCollum","year":"2007","unstructured":"McCollum, B. (2007). A perspective on bridging the gap between theory and practice in university timetabling. In E. K. Burke & H. Rudov\u00e1 (Eds.), Lecture notes in computer science: Vol. 3867. Practice and theory of automated timetabling (pp. 3\u201323). Berlin: Springer."},{"issue":"1","key":"828_CR37","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1287\/ijoc.1090.0320","volume":"22","author":"B. McCollum","year":"2010","unstructured":"McCollum, B., Schaerf, A., Paechter, B., McMullan, P., Lewis, R., Parkes, A. J., Di Gaspero, L., Qu, R., & Burke, E. K. (2010). Setting the research agenda in automated timetabling: the second international timetabling competition. INFORMS Journal on Computing, 22(1), 120\u2013130.","journal-title":"INFORMS Journal on Computing"},{"key":"828_CR38","doi-asserted-by":"crossref","unstructured":"M\u00e9ndez-D\u00edaz, I., & Zabala, P. (2008). A cutting plane algorithm for graph coloring. Discrete Applied Mathematics, 156(2).","DOI":"10.1016\/j.dam.2006.07.010"},{"key":"828_CR39","doi-asserted-by":"crossref","first-page":"814","DOI":"10.1016\/j.amc.2005.07.039","volume":"175","author":"S. A. Mirhassani","year":"2006","unstructured":"Mirhassani, S. A. (2006). A computational approach to enhancing course timetabling with integer programming. Applied Mathematics and Computation, 175, 814\u2013822.","journal-title":"Applied Mathematics and Computation"},{"issue":"1","key":"828_CR40","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1007\/s10479-009-0644-y","volume":"127","author":"T. M\u00fcller","year":"2009","unstructured":"M\u00fcller, T. (2009). ITC-2007 solver description: a hybrid approach. Annals of Operations Research, 127(1), 429\u2013446.","journal-title":"Annals of Operations Research"},{"key":"828_CR41","unstructured":"Niskanen, S., & \u00d6sterg\u00f8ard, P. R. J. (2003). Cliquer user\u2019s guide, version 1.0. Communications Laboratory, Helsinki University of Technology, Espoo, Finland, Tech. rep. T48, 2003."},{"key":"828_CR42","isbn-type":"print","first-page":"1001","volume-title":"Handbook of scheduling: algorithms, models, and performance analysis","author":"S. Petrovic","year":"2004","unstructured":"Petrovic, S., & Burke, E. K. (2004). University timetabling. In J. Leung (Ed.), Handbook of scheduling: algorithms, models, and performance analysis (pp. 1001\u20131023). Boca Raton: CRC Press. ISBN 1584883979.","ISBN":"https:\/\/id.crossref.org\/isbn\/1584883979"},{"key":"828_CR43","series-title":"Lecture notes in computer science","first-page":"161","volume-title":"Practice and theory of automated timetabling","author":"A. Qualizza","year":"2004","unstructured":"Qualizza, A., & Serafini, P. (2004). A column generation scheme for faculty timetabling. In E. K. Burke & M. A. Trick (Eds.), Lecture notes in computer science: Vol. 3616. Practice and theory of automated timetabling (pp. 161\u2013173). Berlin: Springer."},{"key":"828_CR44","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"310","DOI":"10.1007\/978-3-540-45157-0_21","volume-title":"Practice and theory of automated timetabling","author":"H. Rudov\u00e1","year":"2003","unstructured":"Rudov\u00e1, H., & Murray, K. (2003). University course timetabling with soft constraints. In E. K. Burke & P. De Causmaecker (Eds.), Lecture notes in computer science: Vol. 2740. Practice and theory of automated timetabling (pp. 310\u2013328). Berlin: Springer."},{"key":"828_CR45","doi-asserted-by":"crossref","unstructured":"Rudov\u00e1, H., M\u00fcller, T., & Murray, K. (2011). Complex university course timetabling. Journal of Scheduling (to appear). doi: 10.1007\/s10951-010-0171-3 .","DOI":"10.1007\/s10951-010-0171-3"},{"key":"828_CR46","doi-asserted-by":"crossref","unstructured":"Santos, H., Uchoa, E., Ochi, L., & Maculan, N. Strong bounds with cut and column generation for class-teacher timetabling Annals of Operations Research (to appear). doi: 10.1007\/s10479-010-0828-5 .","DOI":"10.1007\/s10479-010-0828-5"},{"issue":"2","key":"828_CR47","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1023\/A:1006576209967","volume":"13","author":"A. Schaerf","year":"1999","unstructured":"Schaerf, A. (1999). A survey of automated timetabling. Artificial Intelligence Review, 13(2), 87\u2013127.","journal-title":"Artificial Intelligence Review"},{"key":"828_CR48","doi-asserted-by":"crossref","first-page":"783","DOI":"10.1007\/s00291-006-0074-z","volume":"29","author":"K. Schimmelpfeng","year":"2007","unstructured":"Schimmelpfeng, K., & Helber, S. (2007). Application of a real-world university-course timetabling model solved by integer programming. OR-Spektrum, 29, 783\u2013803.","journal-title":"OR-Spektrum"},{"issue":"1","key":"828_CR49","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1016\/j.tcs.2006.06.015","volume":"363","author":"E. Tomita","year":"2006","unstructured":"Tomita, E., Tanaka, A., & Takahashi, H. (2006). The worst-case time complexity for generating all maximal cliques and computational experiments. Theoretical Computer Science, 363(1), 28\u201342.","journal-title":"Theoretical Computer Science"},{"key":"828_CR50","doi-asserted-by":"crossref","first-page":"1473","DOI":"10.1287\/mnsc.30.12.1473","volume":"30","author":"A. Tripathy","year":"1984","unstructured":"Tripathy, A. (1984). School timetabling\u2014a case in large binary integer linear programming. Management Science, 30, 1473\u20131489.","journal-title":"Management Science"},{"key":"828_CR51","first-page":"181","volume":"3","author":"M. Vlach","year":"1967","unstructured":"Vlach, M. (1967). Branch and bound method for the three-index assignment problem. Ekonomicko-Matematicky Obzor, 3, 181\u2013191.","journal-title":"Ekonomicko-Matematicky Obzor"},{"issue":"1","key":"828_CR52","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1093\/comjnl\/10.1.85","volume":"10","author":"D. J. A. Welsh","year":"1967","unstructured":"Welsh, D. J. A., & Powel, M. B. (1967). An upper bound for the chromatic number of a graph and its application to timetabling problems. Computer Journal, 10(1), 85\u201386.","journal-title":"Computer Journal"},{"issue":"5","key":"828_CR53","doi-asserted-by":"crossref","first-page":"826","DOI":"10.1016\/j.dam.2005.05.022","volume":"154","author":"P. Zabala","year":"2006","unstructured":"Zabala, P., & M\u00e9ndez-D\u00edaz, I. (2006). A branch-and-cut algorithm for graph coloring. Discrete Applied Mathematics, 154(5), 826\u2013847.","journal-title":"Discrete Applied Mathematics"},{"issue":"6","key":"828_CR54","doi-asserted-by":"crossref","first-page":"103","DOI":"10.4086\/toc.2007.v003a006","volume":"3","author":"D. Zuckerman","year":"2007","unstructured":"Zuckerman, D. (2007). Linear degree extractors and the inapproximability of max clique and chromatic number. Theory of Computing, 3(6), 103\u2013128.","journal-title":"Theory of Computing"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-010-0828-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-010-0828-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-010-0828-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,8]],"date-time":"2019-06-08T08:02:19Z","timestamp":1559980939000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-010-0828-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,2,2]]},"references-count":54,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,4]]}},"alternative-id":["828"],"URL":"https:\/\/doi.org\/10.1007\/s10479-010-0828-5","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,2,2]]}}}