{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T05:02:26Z","timestamp":1773378146677,"version":"3.50.1"},"reference-count":63,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2013,4,7]],"date-time":"2013-04-07T00:00:00Z","timestamp":1365292800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2015,4]]},"DOI":"10.1007\/s10878-013-9612-1","type":"journal-article","created":{"date-parts":[[2013,4,6]],"date-time":"2013-04-06T06:05:37Z","timestamp":1365228337000},"page":"636-654","source":"Crossref","is-referenced-by-count":19,"title":["A set covering approach for multi-depot train driver scheduling"],"prefix":"10.1007","volume":"29","author":[{"given":"Masoud","family":"Yaghini","sequence":"first","affiliation":[]},{"given":"Mohammad","family":"Karimi","sequence":"additional","affiliation":[]},{"given":"Mohadeseh","family":"Rahbar","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,4,7]]},"reference":[{"key":"9612_CR1","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1287\/inte.1050.0158","volume":"35","author":"E Abbink","year":"2005","unstructured":"Abbink E, Fischetti M, Kroon L, Timmer G, Vromans M (2005) Reinventing crew scheduling at Netherlands Railways. Interfaces 35:393\u2013401","journal-title":"Interfaces"},{"key":"9612_CR2","doi-asserted-by":"crossref","first-page":"540","DOI":"10.1016\/j.ejor.2010.02.008","volume":"205","author":"JH Ablanedo-Rosas","year":"2010","unstructured":"Ablanedo-Rosas JH, Rego C (2010) Surrogate constraint normalization for the set covering problem. Eur J Oper Res 205:540\u2013551","journal-title":"Eur J Oper Res"},{"key":"9612_CR3","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1002\/net.10008","volume":"39","author":"RK Ahuja","year":"2002","unstructured":"Ahuja RK, Liu L, Orlin JB, Sharma D, Shughart L (2002) Solving real-life locomotive scheduling problems. Networks 39:43\u201352","journal-title":"Networks"},{"key":"9612_CR4","volume-title":"Network flows","author":"RK Ahuja","year":"1998","unstructured":"Ahuja RK, Magnanti TL, Orlin JB (1998) Network flows. Sloan School of Management, Massachusetts Institute of Technology, Cambridge"},{"key":"9612_CR5","doi-asserted-by":"crossref","unstructured":"Andersson E, Housos E, Kohl N, Wedelin D (1998) Crew pairing optimization. In: G. Yu (ed) Operations Research in the Airline Industry. Kluwer Academic Publishers, US. pp 228\u2013258","DOI":"10.1007\/978-1-4615-5501-8_8"},{"key":"9612_CR6","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1016\/j.orl.2008.09.009","volume":"37","author":"P Avella","year":"2009","unstructured":"Avella P, Boccia M, Vasilyev I (2009) Computational experience with general cutting planes for the Set Covering problem. Oper Res Lett 37:16\u201320","journal-title":"Oper Res Lett"},{"key":"9612_CR7","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1007\/BF01588309","volume":"18","author":"D Avis","year":"1980","unstructured":"Avis D (1980) A note on some computationally difficult set covering problems. Math Program 18:138\u2013145","journal-title":"Math Program"},{"key":"9612_CR8","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/0305-0548(81)90017-4","volume":"8","author":"EK Baker","year":"1981","unstructured":"Baker EK (1981) Efficient heuristic algorithms for the weighted set covering problem. Comput Oper Res 8:303\u2013310","journal-title":"Comput Oper Res"},{"key":"9612_CR9","doi-asserted-by":"crossref","first-page":"875","DOI":"10.1287\/opre.44.6.875","volume":"44","author":"E Balas","year":"1996","unstructured":"Balas E, Carrera MC (1996) A dynamic subgradient-based branch-and-bound procedure for set covering. Oper Res 44:875\u2013890","journal-title":"Oper Res"},{"key":"9612_CR10","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/BFb0120886","volume":"12","author":"E Balas","year":"1980","unstructured":"Balas E, Ho A (1980) Set covering algorithms using cutting planes, heuristics, and subgradient optimization: a computational study. Math Program 12:37\u201360","journal-title":"Math Program"},{"key":"9612_CR11","doi-asserted-by":"crossref","first-page":"316","DOI":"10.1287\/opre.46.3.316","volume":"46","author":"C Barnhart","year":"1998","unstructured":"Barnhart C, Johnson EL, Nemhauser GL, Savelsbergh MWP, Vance PH (1998) Branch and price: column generation for solving huge integer programs. Oper Res 46:316\u2013329","journal-title":"Oper Res"},{"key":"9612_CR12","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1287\/trsc.32.3.221","volume":"32","author":"C Barnhart","year":"1998","unstructured":"Barnhart C, Shenoi RG (1998) An approximate model and solution approach for the long-haul crew pairing problem. Transport Sci 32:221\u2013231","journal-title":"Transport Sci"},{"key":"9612_CR13","doi-asserted-by":"crossref","first-page":"392","DOI":"10.1016\/0377-2217(95)00159-X","volume":"94","author":"JE Beasely","year":"1996","unstructured":"Beasely JE, Chu PC (1996) A genetic algorithm for the set covering problem. Eur J Oper Res 94:392\u2013404","journal-title":"Eur J Oper Res"},{"key":"9612_CR14","doi-asserted-by":"crossref","first-page":"4135","DOI":"10.1016\/j.asoc.2011.02.032","volume":"11","author":"C Blum","year":"2011","unstructured":"Blum C, Puchinger J, Raidl GR, Roli A (2011) Hybrid metaheuristics in combinatorial optimization: a survey. Appl Soft Comput 11:4135\u20134151","journal-title":"Appl Soft Comput"},{"key":"9612_CR15","doi-asserted-by":"crossref","unstructured":"Boschetti M, Maniezzo V, Roffilli M, Rohler AB (2009) Matheuristics: Optimization, Simulation and Control. Proceedings of the 6th International Workshop on Hybrid Metaheuristics: 171\u2013177, HM\u201909","DOI":"10.1007\/978-3-642-04918-7_13"},{"key":"9612_CR16","doi-asserted-by":"crossref","first-page":"611","DOI":"10.1023\/A:1018900128545","volume":"86","author":"MJ Brusco","year":"1999","unstructured":"Brusco MJ, Jacobs LW, Thompson GM (1999) A morphing procedure to supplement a simulated annealing heuristic for cost and coverage-correlated set-covering problems. Ann Oper Res 86:611\u2013627","journal-title":"Ann Oper Res"},{"key":"9612_CR17","doi-asserted-by":"crossref","first-page":"730","DOI":"10.1287\/opre.47.5.730","volume":"47","author":"A Caprara","year":"1999","unstructured":"Caprara A, Fischetti M, Toth P (1999) A heuristic method for the set covering problem. Oper Res 47:730\u2013743","journal-title":"Oper Res"},{"key":"9612_CR18","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1023\/A:1019225027893","volume":"98","author":"A Caprara","year":"2000","unstructured":"Caprara A, Fischetti M, Toth P (2000) Algorithms for the set covering problem. Ann Oper Res 98:353\u2013371","journal-title":"Ann Oper Res"},{"key":"9612_CR19","first-page":"125","volume":"79","author":"A Caprara","year":"1997","unstructured":"Caprara A, Fischetti M, Toth P, Vigo D (1997) Algorithms for railway crew management. Math Program 79:125\u2013141","journal-title":"Math Program"},{"key":"9612_CR20","doi-asserted-by":"crossref","first-page":"820","DOI":"10.1287\/opre.46.6.820","volume":"46","author":"A Caprara","year":"1998","unstructured":"Caprara A, Fischetti M, Toth P, Vigo D (1998) Modeling and solving the crew rostering problem. Oper Res 46:820\u2013830","journal-title":"Oper Res"},{"key":"9612_CR21","first-page":"129","volume-title":"Handbooks in operations research and management science: transportation","author":"A Caprara","year":"2007","unstructured":"Caprara A, Kroon L, Monaci M, Peeters M, Toth P (2007) Passenger railway optimization. In: Barnhart C, Laporte G (eds) Handbooks in operations research and management science: transportation. Elsevier, Amsterdam, pp 129\u2013187"},{"key":"9612_CR22","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/978-0-387-71921-4_3","volume-title":"Metaheuristics: progress in complex systems optimization","author":"M Caserta","year":"2007","unstructured":"Caserta M (2007) Tabu search-based metaheuristic algorithm for large-scale set covering problems. In: Doerner KF, Gendreau M, Greistorfer P, Gutjahr WJ, Hartl RF, Reimann M (eds) Metaheuristics: progress in complex systems optimization. Springer, New York, pp 43\u201363"},{"key":"9612_CR23","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-1-4419-1306-7_1","volume-title":"Matheuristics: hybridizing metaheuristics and mathematical programming","author":"M Caserta","year":"2009","unstructured":"Caserta M, Vo\u00df S (2009) Metaheuristics: intelligent problem solving. In: Maniezzo V, St\u00fctzle T, Vo\u00df S (eds) Matheuristics: hybridizing metaheuristics and mathematical programming. Springer, Berlin, pp 1\u201338"},{"key":"9612_CR24","doi-asserted-by":"crossref","first-page":"490","DOI":"10.1016\/0377-2217(95)00077-1","volume":"93","author":"S Chatterjee","year":"1996","unstructured":"Chatterjee S, Carrera C, Lynch LA (1996) Genetic algorithms and traveling salesman problems. Eur J Oper Res 93:490\u2013510","journal-title":"Eur J Oper Res"},{"key":"9612_CR25","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1016\/S0377-2217(96)00196-8","volume":"97","author":"HD Chu","year":"1997","unstructured":"Chu HD, Gelman E, Johnson EL (1997) Solving large scale crew scheduling problems. Eur J Oper Res 97:260\u2013268","journal-title":"Eur J Oper Res"},{"key":"9612_CR26","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1287\/moor.4.3.233","volume":"4","author":"V Chv\u00e1tal","year":"1979","unstructured":"Chv\u00e1tal V (1979) A greedy heuristic for the set covering problem. Math Oper Res 4:233\u2013235","journal-title":"Math Oper Res"},{"key":"9612_CR27","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/s10107-004-0518-7","volume":"102","author":"E Danna","year":"2005","unstructured":"Danna E, Rothberg E, Le Pape C (2005) Exploring relaxation induced neighbourhoods to improve MIP solutions. Math Program 102:71\u201390","journal-title":"Math Program"},{"key":"9612_CR28","doi-asserted-by":"crossref","first-page":"5787","DOI":"10.1016\/j.eswa.2010.10.053","volume":"38","author":"G Deng","year":"2011","unstructured":"Deng G, Lin W (2011) Ant colony optimization-based algorithm for airline crew scheduling problem. Expert Syst Appl 38:5787\u20135793","journal-title":"Expert Syst Appl"},{"key":"9612_CR29","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/S0377-2217(96)00195-6","volume":"97","author":"G Desaulniers","year":"1997","unstructured":"Desaulniers G, Desrosiers J, Dumas Y, Marc S, Rioux B, Solomon M, Soumis F (1997) Crew pairing at Air France. Eur J Oper Res 97:245\u2013259","journal-title":"Eur J Oper Res"},{"key":"9612_CR30","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1023\/B:ANOR.0000019087.46656.e2","volume":"127","author":"AT Ernst","year":"2004","unstructured":"Ernst AT, Jiang H, Krishnamoorthy M, Owens B, Sier D (2004a) An annotated bibliography of personnel scheduling and rostering. Ann Oper Res 127:21\u2013144","journal-title":"Ann Oper Res"},{"key":"9612_CR31","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0377-2217(03)00095-X","volume":"153","author":"AT Ernst","year":"2004","unstructured":"Ernst AT, Jiang H, Krishnamoorthy M, Sier D (2004b) Staff scheduling and rostering: a review of applications, methods and models. Eur J Oper Res 153:3\u201327","journal-title":"Eur J Oper Res"},{"key":"9612_CR32","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/s10107-003-0395-5","volume":"98","author":"M Fischetti","year":"2003","unstructured":"Fischetti M, Lodi A (2003) Local branching. Math Program 98:23\u201347","journal-title":"Math Program"},{"key":"9612_CR33","doi-asserted-by":"crossref","first-page":"674","DOI":"10.1287\/mnsc.36.6.674","volume":"36","author":"M Fisher","year":"1990","unstructured":"Fisher M, Kedia P (1990) Optimal solution of set covering\/partitioning problems using dual heuristics. Manag Sci 36:674\u2013688","journal-title":"Manag Sci"},{"key":"9612_CR34","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1287\/mnsc.34.3.263","volume":"34","author":"ML Fisher","year":"1988","unstructured":"Fisher ML, Rinnooy Kan AHG (1988) The design, analysis and implementation of heuristics. Manag Sci 34:263\u2013265","journal-title":"Manag Sci"},{"key":"9612_CR35","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. Freeman WH, San Francisco"},{"issue":"3","key":"9612_CR36","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F Glover","year":"1989","unstructured":"Glover F (1989) Tabu search\u2013Part I. ORSA J Comput 1(3):190\u2013206","journal-title":"ORSA J Comput"},{"issue":"1","key":"9612_CR37","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1287\/ijoc.2.1.4","volume":"2","author":"F Glover","year":"1990","unstructured":"Glover F (1990) Tabu search\u2013Part II. ORSA J Comput 2(1):4\u201332","journal-title":"ORSA J Comput"},{"key":"9612_CR38","doi-asserted-by":"crossref","unstructured":"Glover F, Laguna M (1997) Tabu search. Kluwer Academic Publishers, Boston","DOI":"10.1007\/978-1-4615-6089-0"},{"key":"9612_CR39","unstructured":"Glover F, Laguna M (2002) Tabu search. In: Pardalos PM, Resende MGC (eds) Handbook of applied optimization. Oxford University Press, New York, pp 194\u2013208"},{"key":"9612_CR40","first-page":"653","volume":"29","author":"F Glover","year":"2000","unstructured":"Glover F, Laguna M, Mart\u00ed F (2000) Fundamentals of scatter search and path relinking. Control Cybern 29:653\u2013684","journal-title":"Control Cybern"},{"key":"9612_CR41","unstructured":"Goossens JWHM (2004) Models and algorithms for railway line planning models. PhD Thesis, University of Maastricht, Netherlands"},{"key":"9612_CR42","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1287\/mnsc.39.6.657","volume":"39","author":"KL Hoffman","year":"1993","unstructured":"Hoffman KL, Padberg M (1993) Solving airline crew scheduling problems by branch-and-cut. Manag Sci 39:657\u2013682","journal-title":"Manag Sci"},{"key":"9612_CR43","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/j.ejor.2006.04.026","volume":"180","author":"D Huisman","year":"2007","unstructured":"Huisman D (2007) A column generation approach to solve the crew re-scheduling problem. Eur J Oper Res 180:163\u2013173","journal-title":"Eur J Oper Res"},{"key":"9612_CR44","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1007\/978-3-642-56423-9_11","volume-title":"Computer-aided scheduling of public transport","author":"LG Kroon","year":"2001","unstructured":"Kroon LG, Fischetti M (2001) Crew scheduling for Netherlands Railways \u201cdestination: customer\u201d. In: Vo\u00df S, Daduna JR (eds) Computer-aided scheduling of public transport. Springer, Berlin, pp 181\u2013201"},{"key":"9612_CR45","unstructured":"Kwan A (1999) Train Driver Scheduling. PhD Thesis, School of Computer Studies, University of Leeds, Leeds, UK"},{"key":"9612_CR46","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1007\/s10479-007-0203-3","volume":"155","author":"RSK Kwan","year":"2007","unstructured":"Kwan RSK, Kwan A (2007) Effective search space control for large and\/or complex driver scheduling problems. Ann Oper Res 155:417\u2013435","journal-title":"Ann Oper Res"},{"key":"9612_CR47","doi-asserted-by":"crossref","first-page":"1387","DOI":"10.1016\/j.ejor.2005.09.028","volume":"176","author":"G Lan","year":"2007","unstructured":"Lan G, DePuy GW, Whitehouse GE (2007) An effective and simple heuristic for the set covering problem. Eur J Oper Res 176:1387\u20131403","journal-title":"Eur J Oper Res"},{"key":"9612_CR48","first-page":"292","volume":"5","author":"CK Lee","year":"2003","unstructured":"Lee CK, Chen CH (2003) Scheduling of train driver for Taiwan railway administration. J East Asia Soc Trans Sci 5:292\u2013306","journal-title":"J East Asia Soc Trans Sci"},{"key":"9612_CR49","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-3-540-28646-2_1","volume":"3172","author":"L Lessing","year":"2004","unstructured":"Lessing L, Dumitrescu I, St\u00fctzle T (2004) A comparison between ACO algorithms for the set covering problem. Lect Notes Comput Sc 3172:1\u201312","journal-title":"Lect Notes Comput Sc"},{"key":"9612_CR50","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1016\/0305-0548(95)00060-7","volume":"23","author":"D Levine","year":"1996","unstructured":"Levine D (1996) Application of a hybrid genetic algorithm to airline crew scheduling. Comput Oper Res 23:547\u2013558","journal-title":"Comput Oper Res"},{"key":"9612_CR51","doi-asserted-by":"crossref","first-page":"1562","DOI":"10.1016\/j.cor.2006.09.001","volume":"35","author":"M Mesquita","year":"2008","unstructured":"Mesquita M, Paias A (2008) Set partitioning\/covering-based approaches for the integrated vehicle and crew scheduling problem. Comput Oper Res 35:1562\u20131575","journal-title":"Comput Oper Res"},{"key":"9612_CR52","volume-title":"Design and analysis of experiments","author":"DC Montgomery","year":"2009","unstructured":"Montgomery DC (2009) Design and analysis of experiments. Wiley, New York"},{"key":"9612_CR53","unstructured":"Parker ME, Smith BM (1991) Two approaches to computer crew scheduling. In: Wren A (ed) Proceedings of Second International Workshop on Computer-Aided Scheduling of Public Transport, North-Holland, Amsterdam, pp 193\u2013221"},{"key":"9612_CR54","first-page":"223","volume":"4","author":"S Raja Balachandar","year":"2010","unstructured":"Raja Balachandar S, Kannan K (2010) A meta-heuristic algorithm for set covering problem based on gravity. Int J Math Comput Sci 4:223\u2013228","journal-title":"Int J Math Comput Sci"},{"key":"9612_CR55","doi-asserted-by":"crossref","first-page":"774","DOI":"10.1016\/j.cie.2010.02.011","volume":"58","author":"Z Ren","year":"2010","unstructured":"Ren Z, Feng Z, Ke L, Zhang Z (2010) New ideas for applying ant colony optimization to the set covering problem. Comput Ind Eng 58:774\u2013784","journal-title":"Comput Ind Eng"},{"key":"9612_CR56","first-page":"350","volume":"50","author":"S Umetani","year":"2007","unstructured":"Umetani S, Yagiura M (2007) Relaxation heuristics for the set covering problem. J Oper Res Soc Japan 50:350\u2013375","journal-title":"J Oper Res Soc Japan"},{"key":"9612_CR57","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1002\/nav.3800310118","volume":"31","author":"FJ Vasko","year":"1984","unstructured":"Vasko FJ, Wilson GR (1984a) An efficient heuristic for large set covering problems. Nav Res Logist Q 31:163\u2013171","journal-title":"Nav Res Logist Q"},{"key":"9612_CR58","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0167-6377(84)90047-6","volume":"3","author":"FJ Vasko","year":"1984","unstructured":"Vasko FJ, Wilson GR (1984b) Using a facility location algorithm to solve large set covering problems. Oper Res Lett 3:85\u201390","journal-title":"Oper Res Lett"},{"key":"9612_CR59","unstructured":"Wren A (1981) General review of the use of computers in scheduling buses and their crews. In: Wren A (ed) Computer scheduling of public transport, North-Holland, Amsterdam, pp 3\u201316"},{"key":"9612_CR60","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/978-3-642-57762-8_12","volume-title":"Computer-aided transit scheduling","author":"A Wren","year":"1995","unstructured":"Wren A, Rousseau JM (1995) Bus driver scheduling\u2014an overview. In: Daduna JR, Branco I, Paixao JMP (eds) Computer-aided transit scheduling. Springer, Berlin, pp 173\u2013187"},{"key":"9612_CR61","first-page":"381","volume":"6","author":"M Yaghini","year":"2009","unstructured":"Yaghini M, Ghannadpour SF (2009) Railway crew scheduling using heuristic model. J Trans Res 6:381\u2013395 (In Persian)","journal-title":"J Trans Res"},{"key":"9612_CR62","doi-asserted-by":"crossref","first-page":"472","DOI":"10.1016\/j.ejor.2004.10.018","volume":"172","author":"M Yagiura","year":"2006","unstructured":"Yagiura M, Kishida M, Ibaraki T (2006) A 3-flip neighborhood local search for the set covering problem. Eur J Oper Res 172:472\u2013499","journal-title":"Eur J Oper Res"},{"key":"9612_CR63","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1016\/S0377-2217(01)00060-1","volume":"136","author":"S Yan","year":"2002","unstructured":"Yan S, Chang JC (2002) Airline cockpit crew scheduling. Eur J Oper Res 136:501\u2013511","journal-title":"Eur J Oper Res"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-013-9612-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-013-9612-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-013-9612-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,11]],"date-time":"2019-07-11T20:57:09Z","timestamp":1562878629000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-013-9612-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,4,7]]},"references-count":63,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,4]]}},"alternative-id":["9612"],"URL":"https:\/\/doi.org\/10.1007\/s10878-013-9612-1","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,4,7]]}}}