{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T18:50:15Z","timestamp":1775069415952,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":58,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540649793","type":"print"},{"value":"9783540498032","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0055878","type":"book-chapter","created":{"date-parts":[[2006,7,27]],"date-time":"2006-07-27T16:57:50Z","timestamp":1154019470000},"page":"3-19","source":"Crossref","is-referenced-by-count":100,"title":["Recent developments in practical course timetabling"],"prefix":"10.1007","author":[{"given":"Michael W.","family":"Carter","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gilbert","family":"Laporte","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,5,24]]},"reference":[{"issue":"No.1","key":"1_CR1","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1287\/mnsc.37.1.98","volume":"37","author":"D. Abramson","year":"1991","unstructured":"Abramson, D., \u201cConstructing School Timetables Using Simulated Annealing: Sequential and Parallel Algorithms\u201d, Man. Sci. 37, No. 1, pp. 98\u2013113., 1991.","journal-title":"Man. Sci."},{"key":"1_CR2","unstructured":"Adamidis, P. and Arapakis, P., \u201cWeekly Lecture Timetabling with Genetic Algorithms\u201d, PATAT \u201991."},{"key":"1_CR3","volume-title":"Local Search in Combinatorial Optimization","author":"E. Aarts","year":"1997","unstructured":"Aarts, E. and Lenstra, J.K., Local Search in Combinatorial Optimization, Wiley, Chichester, 1997."},{"issue":"No.1","key":"1_CR4","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/0305-0548(89)90053-1","volume":"16","author":"J. Aubin","year":"1989","unstructured":"Aubin, J. and Ferland, J.A., \u201cA Large Scale Timetabling Problem\u201d, Computers & Operations Research 16, No. 1, pp. 67\u201377, 1989.","journal-title":"Computers & Operations Research"},{"key":"1_CR5","unstructured":"Azevedo, F. and Barahona, P., \u201cTimetabling in Constraint Logic Programming\u201d, Proceedings of World Congress on Expert Systems\u201994."},{"issue":"No.4","key":"1_CR6","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1287\/inte.9.4.24","volume":"9","author":"S.D. Bloomfield","year":"1979","unstructured":"Bloomfield, S.D. and McSharry, M.M., \u201cPreferential Course Scheduling\u201d, Interfaces 9, No. 4, pp. 24\u201331, August 1979.","journal-title":"Interfaces"},{"issue":"No.2","key":"1_CR7","first-page":"230","volume":"27","author":"M.W. Carter","year":"1989","unstructured":"Carter, M.W., \u201cA Lagrangian Relaxation Approach to the Classroom Assignment Problem\u201d, INFOR 27, No. 2, pp. 230\u2013246, 1989.","journal-title":"INFOR"},{"issue":"Supp.No.1","key":"1_CR8","doi-asserted-by":"crossref","first-page":"S28","DOI":"10.1287\/opre.40.1.S28","volume":"40","author":"M.W. Carter","year":"1992","unstructured":"Carter, M.W. and Tovey, C.A., \u201cWhen Is the Classroom Assignment Problem Hard?\u201d, Oper. Res. 40, Supp. No. 1, pp. S28\u2013S39, 1992.","journal-title":"Oper. Res."},{"issue":"No.3","key":"1_CR9","doi-asserted-by":"publisher","first-page":"373","DOI":"10.2307\/3010580","volume":"47","author":"M.W. Carter","year":"1996","unstructured":"Carter, M.W., Laporte, G. and Lee, S.Y., \u201cExamination Timetabling: Algorithmic Strategies and Applications\u201d, J. of Operational Research Society 47, No. 3, 373\u2013383, March 1996.","journal-title":"J. of Operational Research Society"},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"Carter, M.W. and Laporte, G., \u201cRecent Developments in Practical Examination Timetabling\u201d, in Practice and Theory of Automated Timetabling, Springer-Verlag Lecture Notes in Computer Science 1153, Burke & Ross, eds., 1996.","DOI":"10.1007\/3-540-61794-9_49"},{"key":"1_CR11","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/0377-2217(89)90269-5","volume":"40","author":"N. Chahal","year":"1989","unstructured":"Chahal, N. and de Werra, D., \u201cAn Interactive System for Constructing Timetables on a PC\u201d, EJOR 40, pp. 32\u201337, 1989.","journal-title":"EJOR"},{"key":"1_CR12","unstructured":"Chan, H.W., Lau, C.K., and Sheung, J., \u201cPractical School Timetabling: A Hybrid Approach Using Solution Synthesis and Iterative Repair\u201d, in Practice and Theory of Automated Timetabling, Springer-Verlag Lecture Notes in Computer Science, Burke & Carter, eds., 1998."},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"Cheng,C, Kang,L., Leung,N. and White, G.M., \u201cInvestigations of a Constraint Logic Programming Approach to University Timetabling\u201d, in Practice and Theory of Automated Timetabling, Springer-Verlag Lecture Notes in Computer Science 1153, Burke & Ross, eds., 1996.","DOI":"10.1007\/3-540-61794-9_55"},{"key":"1_CR14","doi-asserted-by":"crossref","unstructured":"Colorni A., Dorigo M. and Maniezzo V., \u201cGenetic Algorithms \u2014 A New Approach to the Timetable Problem\u201d, Lecture Notes in Computer Science \u2014 NATO ASI Series, Vol. F 82, Combinatorial Optimization, (Akgul et al eds), Springer-Verlag, pp 235\u2013239. 1990. (1992?)","DOI":"10.1007\/978-3-642-77489-8_14"},{"issue":"no7","key":"1_CR15","doi-asserted-by":"publisher","first-page":"645","DOI":"10.1093\/comjnl\/36.7.645","volume":"36","author":"T.B. Cooper","year":"1993","unstructured":"Cooper, T.B. and Kingston, J.H., \u201cThe Solution of Real Instances of the Timetabling Problem\u201d, The Computer Journal, vol 36, no 7, pp 645\u2013653, 1993.","journal-title":"The Computer Journal"},{"key":"1_CR16","doi-asserted-by":"crossref","unstructured":"Corne, D., and Ross, P., \u201cPeckish Initialization Strategies for Evolutionary Timetabling\u201d, in Practice and Theory of Automated Timetabling, Springer-Verlag Lecture Notes in Computer Science 1153, Burke & Ross, eds., 1996.","DOI":"10.1007\/3-540-61794-9_62"},{"key":"1_CR17","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1016\/0377-2217(94)90009-4","volume":"76","author":"D. Costa","year":"1994","unstructured":"Costa, D., \u201cA Tabu Search Algorithm for Computing an Operational Timetable\u201d, European J. of Operational Res. 76, pp. 98\u2013110, 1994.","journal-title":"European J. of Operational Res."},{"key":"1_CR18","first-page":"231","volume-title":"Schedule Optimization with Probabilistic Search","author":"L. Davis","year":"1987","unstructured":"Davis, L. and Ritter, L., \u201cSchedule Optimization with Probabilistic Search\u201d, Proceedings of the 3rd IEEE Conference on Artificial Intelligence Applications, Orlando, Florida, USA, pp. 231\u2013236, IEEE, 1987."},{"key":"1_CR19","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/0377-2217(81)90279-4","volume":"7","author":"O.B. Gans de","year":"1981","unstructured":"de Gans, O.B., \u201cA Computer Timetabling System for Secondary Schools in The Netherlands\u201d, EJOR 7, 175\u2013182, 1981.","journal-title":"EJOR"},{"issue":"No.1","key":"1_CR20","first-page":"12","volume":"9","author":"D. Werra de","year":"1971","unstructured":"de Werra, D., \u201cConstruction of School Timetables by Flow Methods\u201d, INFOR 9, No.1, 1971, 12\u201322.","journal-title":"INFOR"},{"issue":"No.6","key":"1_CR21","doi-asserted-by":"crossref","first-page":"853","DOI":"10.1287\/opre.37.6.853","volume":"37","author":"J.J. Dinkel","year":"1989","unstructured":"Dinkel, J.J., Mote, J. and Venkataramanan, M.A., \u201cAn Efficient Decision Support System for Academic Course Scheduling\u201d, Operations Research 37, No. 6, pp. 853\u2013864, 1989.","journal-title":"Operations Research"},{"key":"1_CR22","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1002\/ir.37019771306","volume":"13","author":"J.S. Dyer","year":"1977","unstructured":"Dyer, J.S. and Mulvey, J.M., \u201cComputerized Scheduling and Planning\u201d, New Directions for Institutional Research 13, pp. 67\u201386, 1977.","journal-title":"New Directions for Institutional Research"},{"key":"1_CR23","doi-asserted-by":"crossref","unstructured":"Elmohamed, S., Coddington, P., and Fox, G., \u201cA Comparison of Annealing Techniques for Academic Course Scheduling\u201d, in Practice and Theory of Automated Timetabling, Springer-Verlag Lecture Notes in Computer Science, Burke & Carter, eds., 1998.","DOI":"10.1007\/BFb0055883"},{"key":"1_CR24","doi-asserted-by":"crossref","unstructured":"Erben,W. and Keppler, J., \u201cA Genetic Algorithm Solving a Weekly Course Timetabling Problem\u201d, in Practice and Theory of Automated Timetabling, Springer-Verlag Lecture Notes in Computer Science 1153, Burke & Ross, eds., 1996.","DOI":"10.1007\/3-540-61794-9_60"},{"issue":"No.3","key":"1_CR25","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/0166-218X(92)90246-7","volume":"35","author":"R. Fahrion","year":"1992","unstructured":"Fahrion, R. and Dollansky, G., \u201cConstruction of University Faculty Timetables Using Logic Programming\u201d, Discrete Applied Mathematics 35, No. 3, pp. 221\u2013236, 1992.","journal-title":"Discrete Applied Mathematics"},{"issue":"No.5","key":"1_CR26","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1287\/inte.16.5.92","volume":"16","author":"C.R. Glassey","year":"1986","unstructured":"Glassey, C.R. and Mizrach, M., \u201cA Decision Support System for Assigning Classes to Rooms\u201d, Interfaces 16, No. 5, pp. 92\u2013100, 1986.","journal-title":"Interfaces"},{"issue":"No.6","key":"1_CR27","doi-asserted-by":"publisher","first-page":"561","DOI":"10.2307\/2582583","volume":"37","author":"K. Gosselin","year":"1986","unstructured":"Gosselin, K. and Truchon, M., \u201cAllocation of Classrooms by Linear Programming\u201d, J. Operational Research Soc. 37, No. 6, 561\u2013569, 1986.","journal-title":"J. Operational Research Soc."},{"issue":"No.5","key":"1_CR28","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1287\/inte.23.5.81","volume":"23","author":"R.L. Graves","year":"1993","unstructured":"Graves, R.L., Schrage, L. and Sankaran, J., \u201cAn Auction Method for Course Registration\u201d, Interfaces 23, No. 5, pp 81\u201392, September\u2013October 1993.","journal-title":"Interfaces"},{"key":"1_CR29","doi-asserted-by":"crossref","unstructured":"Gueret,G., Jussien,N., Boizumault,P. and Prins, C., \u201cBuilding University Timetables Using Constraint Logic Programming\u201d, in Practice and Theory of Automated Timetabling, Springer-Verlag Lecture Notes in Computer Science 1153, Burke & Ross, eds., 1996.","DOI":"10.1007\/3-540-61794-9_56"},{"key":"1_CR30","doi-asserted-by":"crossref","unstructured":"Henz,M. and Wurtz,J., \u201cUsing Oz for College Timetabling\u201d, in Practice and Theory of Automated Timetabling, Springer-Verlag Lecture Notes in Computer Science 1153, Burke & Ross, eds., 1996.","DOI":"10.1007\/3-540-61794-9_58"},{"key":"1_CR31","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/0377-2217(91)90321-L","volume":"54","author":"A. Hertz","year":"1991","unstructured":"Hertz, A., \u201cTabu Search for Large Scale Timetabling Problems\u201d, EJOR 54, pp. 39\u201347, 1991.","journal-title":"EJOR"},{"key":"1_CR32","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1016\/0743-1066(94)90033-7","volume":"19\/20","author":"J. Jaffar","year":"1994","unstructured":"Jaffar, J. and Maher, M.J., \u201cConstraint Logic Programming: A Survey\u201d, Journal of Logic Programming 19\/20, pp. 503\u2013581, 1994.","journal-title":"Journal of Logic Programming"},{"key":"1_CR33","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1016\/0377-2217(92)90360-L","volume":"61","author":"L. Kang","year":"1992","unstructured":"Kang, L. and White, G.M., \u201cA Logic Approach to the Resolution of Constraints in Timetabling\u201d, European Journal of Operational Research 61, pp. 306\u2013317, 1992.","journal-title":"European Journal of Operational Research"},{"issue":"No.2","key":"1_CR34","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/0360-1315(91)90092-6","volume":"17","author":"L. Kang","year":"1991","unstructured":"Kang, L., Von Schoenberg, G.H. and White, G.M., 1Complete University Timetabling Using Logicl, Computers and Education, 17 No. 2, pp. 145\u2013153, 1991.","journal-title":"Computers and Education"},{"key":"1_CR35","doi-asserted-by":"crossref","unstructured":"Lajos, G., \u201cComplete University Modular Timetabling Using Constraint Logic Programming\u201d, in Practice and Theory of Automated Timetabling, Springer-Verlag Lecture Notes in Computer Science 1153, Burke & Ross, eds., 1996.","DOI":"10.1007\/3-540-61794-9_57"},{"issue":"No.4","key":"1_CR36","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1016\/0305-0548(86)90025-0","volume":"13","author":"G. Laporte","year":"1986","unstructured":"Laporte, G. and Desroches, S., \u201cThe Problem of Assigning Students to Course Sections in a Large Engineering School\u201d, Comp. & Ops. Res. 13, No. 4, pp. 387\u2013394, 1986.","journal-title":"Comp. & Ops. Res."},{"issue":"No.3","key":"1_CR37","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1111\/j.1540-5915.1984.tb01226.x","volume":"15","author":"R.H. McClure","year":"1984","unstructured":"McClure, R.H. and Wells, C.E., \u201cA Mathematical Programming Model for Faculty Course Assignments\u201d, Decision Sciences 15, No. 3, pp. 409\u2013420, 1984.","journal-title":"Decision Sciences"},{"issue":"No.1","key":"1_CR38","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1016\/0377-2217(88)90256-1","volume":"33","author":"I. Miyaji","year":"1981","unstructured":"Miyaji, I., Ohno, K. and Mine, H., Solution Method for Partitioning Students into Groupsl, European Journal of Operational Research, 33, No. 1, pp. 82\u201390. 616, 1981.","journal-title":"European Journal of Operational Research"},{"key":"1_CR39","doi-asserted-by":"crossref","unstructured":"Nepal, T., Melville, S.W., and Ally, M.I., \u201cA Brute Force and Heuristics Approach to Tertiary Timetabling\u201d, in Practice and Theory of Automated Timetabling, Springer-Verlag Lecture Notes in Computer Science, Burke & Carter, eds., 1998.","DOI":"10.1007\/BFb0055894"},{"key":"1_CR40","doi-asserted-by":"crossref","unstructured":"Ng, W.-Y., \u201cTESS: An Interactive Support System for School Timetabling\u201d, Information Technology in Educational Management for the Schools of the Future, Fung et al (ed.), Chapman and Hall, pp. 131\u2013137, 1997.","DOI":"10.1007\/978-0-387-35090-5_17"},{"key":"1_CR41","series-title":"Annals of Operations Research 63","first-page":"513","volume-title":"Metaheuristics in Combinatorial Optimization","author":"I.H. Osman","year":"1996","unstructured":"Osman, I.H. and Laporte, G., \u201cMetaheuristics: A Bibliography. G. Laporte and I.H. Osman (eds), Metaheuristics in Combinatorial Optimization\u201d, Annals of Operations Research 63, pp. 513\u2013623, Baltzer, Amsterdam, 1996."},{"key":"1_CR42","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/BF01719788","volume":"3","author":"R. Ostermann","year":"1982","unstructured":"Ostermann, R. and de Werra, D., \u201cSome Experiments with a Timetabling System\u201d, OR Spektrum 3, pp. 199\u2013204, 1982.","journal-title":"OR Spektrum"},{"key":"1_CR43","doi-asserted-by":"crossref","unstructured":"Paechter, B., Cumming, A. and Luchian, H., \u201cThe Use of Local Search Suggestion Lists for Improving the Solution of Timetable Problems with Evolutionary Algorithms\u201d, In Proceedings of the AISB Workshop on Evolutionary Computing, Sheffield, England, April 3\u20137, 1995.","DOI":"10.1007\/3-540-60469-3_27"},{"key":"1_CR44","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/0377-2217(80)90037-5","volume":"4","author":"D.B. Papoulias","year":"1980","unstructured":"Papoulias, D.B., \u201cThe Assignment-to-days problem in a School Time-table, a Heuristic Approach\u201d, EJOR 4, pp. 31\u201341, 1980.","journal-title":"EJOR"},{"key":"1_CR45","first-page":"159","volume":"20","author":"D. Poutain","year":"1995","unstructured":"Poutain, D., \u201cConstraint Logic Programming\u201d, Byte 20, pp. 159\u2013160, 1995.","journal-title":"Byte"},{"key":"1_CR46","doi-asserted-by":"crossref","unstructured":"Ram,V. and Scogings, C., \u201cAutomated Time Table Generation Using Multiple Context Reasoning with Truth Maintenance\u201d, in Practice and Theory of Automated Timetabling, Springer-Verlag Lecture Notes in Computer Science 1153, Burke & Ross, eds., 1996.","DOI":"10.1007\/3-540-61794-9_54"},{"key":"1_CR47","doi-asserted-by":"crossref","unstructured":"Rankin, R.C., \u201cAutomatic Timetabling in Practice\u201d, in Practice and Theory of Automated Timetabling, Springer-Verlag Lecture Notes in Computer Science 1153, Burke & Ross, eds., 1996.","DOI":"10.1007\/3-540-61794-9_65"},{"key":"1_CR48","volume-title":"1Modern Heuristic Techniques for Combinatorial Problems 1","author":"C.R. Reeves","year":"1993","unstructured":"Reeves, C.R., 1Modern Heuristic Techniques for Combinatorial Problems 1, Blackwell, Oxford, 1993."},{"key":"1_CR49","doi-asserted-by":"crossref","unstructured":"Rich, D.C., \u201cA Smart Genetic Algorithm for University Timetabling\u201d, in Practice and Theory of Automated Timetabling, Springer-Verlag Lecture Notes in Computer Science 1153, Burke & Ross, eds., 1996.","DOI":"10.1007\/3-540-61794-9_59"},{"key":"1_CR50","unstructured":"Ross, P., Corne, D. and Fang, H.-L., \u201cSuccessful Lecture Timetabling with Evolutionary Algorithms\u201d, Dept of A.I. Working Paper, University of Edinburg, 1994."},{"issue":"No.7","key":"1_CR51","doi-asserted-by":"publisher","first-page":"689","DOI":"10.2307\/2582040","volume":"37","author":"G.C.W. Sabin","year":"1986","unstructured":"Sabin, G.C.W. and Winter, G.K., \u201cThe Impact of Automated Timetabling on Universities \u2014 A Case Study\u201d, J. Operational Research Soc. 37, No.7, pp. 689\u2013693, 1986.","journal-title":"J. Operational Research Soc."},{"issue":"No.3","key":"1_CR52","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1287\/inte.25.3.30","volume":"25","author":"S.E. Sampson","year":"1995","unstructured":"Sampson, S.E., Freeland, J.R. and Weiss, E.N., \u201cClass Scheduling to Maximize Participant Satisfaction\u201d, Interfaces 25, No. 3, pp. 30\u201341, May\u2013June 1995.","journal-title":"Interfaces"},{"key":"1_CR53","unstructured":"Schaerf, A., \u201cTabu Search Techniques for Large High-School Timetabling Problems\u201d, Comp. Science\/Dept. of Interactive Systems, CS-R9611, Centrum voor Wiskunde en Informatica, SMC, Netherlands Organization for Scientific Researchm 1996."},{"issue":"No.2","key":"1_CR54","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/0305-0548(87)90001-3","volume":"14","author":"M.J. Schniederjans","year":"1987","unstructured":"Schniederjans, M.J. and Kim, G.C., \u201cA Goal Programming Model to Optimize Departmental Preference in Course Assignments\u201d, Comput. Opns. Res. 14, No. 2, pp. 87\u201396, 1987.","journal-title":"Comput. Opns. Res."},{"issue":"No.4","key":"1_CR55","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1016\/0360-1315(82)90052-5","volume":"6","author":"S.M. Selim","year":"1982","unstructured":"Selim, S.M., \u201cAn Algorithm for Constructing a Unversity Faculty Timetable\u201d, Comput. Educ. 6, No. 4, pp. 323\u2013334., 1982.","journal-title":"Comput. Educ."},{"key":"1_CR56","doi-asserted-by":"crossref","unstructured":"White, G.M., and Zhang, J., \u201cGenerating Complete University Timetables by Combining Tabu Search with Constraint Logic\u201d, in Practice and Theory of Automated Timetabling, Springer-Verlag Lecture Notes in Computer Science, Burke & Carter, eds., 1998.","DOI":"10.1007\/BFb0055889"},{"key":"1_CR57","doi-asserted-by":"publisher","first-page":"347","DOI":"10.2307\/3010577","volume":"47","author":"M. Wright","year":"1996","unstructured":"Wright, M., \u201cSchool Timetabling using Heuristic Search\u201d, Journal of the Operational Research Society, Vol. 47, pp. 347\u2013357, 1996.","journal-title":"Journal of the Operational Research Society"},{"key":"1_CR58","first-page":"63","volume-title":"IEEE Expert, Vol. 11","author":"M. Yoshikawa","year":"1996","unstructured":"Yoshikawa, M., Kaneko, K., Yamanouchi, T. and Watanabe, N., \u201cA Constraint-Based High School Scheduling System\u201d, IEEE Expert, Vol. 11, No. 1, IEEE Coputer Society, Los Alamitos, CA., pp. 63\u201372, February 1996."}],"container-title":["Lecture Notes in Computer Science","Practice and Theory of Automated Timetabling II"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0055878","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,20]],"date-time":"2019-04-20T05:08:21Z","timestamp":1555736901000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0055878"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540649793","9783540498032"],"references-count":58,"URL":"https:\/\/doi.org\/10.1007\/bfb0055878","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1998]]}}}