{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,21]],"date-time":"2024-07-21T00:50:59Z","timestamp":1721523059053},"reference-count":67,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2006,8,24]],"date-time":"2006-08-24T00:00:00Z","timestamp":1156377600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["4OR"],"published-print":{"date-parts":[[2006,9]]},"DOI":"10.1007\/s10288-006-0019-z","type":"journal-article","created":{"date-parts":[[2006,8,23]],"date-time":"2006-08-23T10:44:10Z","timestamp":1156329850000},"page":"175-219","source":"Crossref","is-referenced-by-count":18,"title":["Integrating operations research in constraint programming"],"prefix":"10.1007","volume":"4","author":[{"given":"Michela","family":"Milano","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mark","family":"Wallace","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,8,24]]},"reference":[{"key":"19_CR1","unstructured":"Ahmed S, Shapiro A (2002) The sample average approximation method for stochastic programs with integer recourse. In: Optimization on line"},{"key":"19_CR2","unstructured":"Applegate D, Bixby R, Chv\u00e1tal V, Cook W (1999) Tsp-solver concorde. http:\/\/www.keck.caam. rice.edu\/concorde.html"},{"key":"19_CR3","volume-title":"Constraint logic programming using ECLiPSe","author":"KR Apt","year":"2006","unstructured":"Apt KR, Wallace MG (2006) Constraint logic programming using ECLiPSe. Cambridge University Press, Cambridge"},{"key":"19_CR4","doi-asserted-by":"crossref","unstructured":"Arbab F, Monfroy E (1998) Coordination of heterogeneous distributed cooperative constraint solving. Appl Comput Rev 6:4\u201317 ACM SIGAPP","DOI":"10.1145\/297114.297115"},{"key":"19_CR5","unstructured":"Baptiste P, Le Pape C, Nuijten W (1995) Efficient operations research algorithms in constraint-based scheduling. In: 1st joint workshop on artificial intelligence and operational research"},{"key":"19_CR6","volume-title":"Constraint-based scheduling","author":"P Baptiste","year":"2003","unstructured":"Baptiste P, Le Pape C, Nuijten W (2003) Constraint-based scheduling. Kluwer, Dordrecht"},{"key":"19_CR7","unstructured":"Beldiceanu N, Bourreau E, Chan P, Rivreau D (1997) Partial search strategy in CHIP. In: Proceedings of the 2nd International conference on meta-heuristics"},{"key":"19_CR8","doi-asserted-by":"crossref","unstructured":"Beldiceanu N, Carlsson M (2002) A new multi-resource cumulatives constraint with negative heights. In: Proceedings of the International Conference on principles and practice of constraint programming CP 2002, vol 2470 of \u201cLNCS\u201d. Springer, Berlin Heidelberg New York, pp 63\u201379","DOI":"10.1007\/3-540-46135-3_5"},{"key":"19_CR9","unstructured":"Beldiceanu N, Carlsson M, Rampon J-X (2005) Global constraint catalog. In: SICS Technical Report T2005:08"},{"key":"19_CR10","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1007\/BF01386316","volume":"4","author":"JF Benders","year":"1962","unstructured":"Benders JF (1962) Partitioning procedures for solving mixed-variables programming problems. Numer Math 4:238\u2013252","journal-title":"Numer Math"},{"key":"19_CR11","unstructured":"Benhamou F, Granvilliers L, Goualard F (1999) Interval constraints: results and perspectives. In: New trends in constraints, pp 1\u201316"},{"key":"19_CR12","unstructured":"Beringer H, De Backer B (1995) Combinatorial problem solving in constraint logic programming with cooperating solvers. In: Beierle C, Pl\u00fcmer L (eds) Logic programming: formal methods and practical applications. North Holland, pp 245\u2013272"},{"key":"19_CR13","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/S0004-3702(02)00263-1","volume":"141","author":"C B\u00e8ssiere","year":"2002","unstructured":"B\u00e8ssiere C, Meseguer P, Freuder E, Larrosa J (2002) On forward checking for non binary constraint satisfaction. Artif Intell 141:205\u2013224","journal-title":"Artif Intell"},{"key":"19_CR14","unstructured":"B\u00e8ssiere C, R\u00e9gin JC (1997) Arc consistency for general constraint networks: preliminary results. In: Pollack M (ed) Proceedings of the international joint conference on artificial intelligence, IJCAI, Morgan Kaufmann, pp 398\u2013404"},{"key":"19_CR15","doi-asserted-by":"crossref","unstructured":"Bousonville T, Focacci F, Le Pape C, Nuijten E, Paulin F, Puget JF, Robert A, Sadeghin A (2005) Integration of rules and optimization in plant powerops. In: Bartak R, Milano M (eds) Proceedings of the international conference in the integration of AI and OR techniques in constraint programming \u2013 CPAIOR 2005, vol 3524 of LNCS. Springer, Berlin Heidelberg New York, pp 1\u201315","DOI":"10.1007\/11493853_1"},{"key":"19_CR16","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1287\/mnsc.35.2.164","volume":"35","author":"J Carlier","year":"1995","unstructured":"Carlier J, Pinson E (1995) An algorithm for solving job shop scheduling. Manage Sci 35:164\u2013176","journal-title":"Manage Sci"},{"key":"19_CR17","doi-asserted-by":"crossref","unstructured":"Cheng BMW, Lee JHM, Wu JCK (1996) Speeding up constraint propagation by redundant modeling. In: Freuder EC (ed) Proceedings of the international conference on principles and practice of constraint programming, vol 1118 of \u201cLNCS\u201d. Springer, Berlin Heidelberg New York, pp 91\u2013103","DOI":"10.1007\/3-540-61551-2_68"},{"key":"19_CR18","unstructured":"Choi CW, Harvey W, Ho-Man Lee J, Stuckey PJ (2004) Finite domain bounds consistency revisited. URL www.citebase.org\/cgi-bin\/citations?id=oai:arXiv.org:cs\/0412021Codognet P, Diaz D (1996) Compiling constraints in clp(fd). J Logic Prog 27:1\u2013199"},{"issue":"2","key":"19_CR19","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1007\/s101070050092","volume":"86","author":"C Cordier","year":"1999","unstructured":"Cordier C, Marchand H, Laundy R, Wolsey LA (1999) BC-opt: a branch-and-cut code for mixed integer programs. Math Program 86(2):335\u2013354","journal-title":"Math Program"},{"issue":"3","key":"19_CR20","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1287\/ijoc.12.3.223.12638","volume":"12","author":"TG Crainic","year":"2000","unstructured":"Crainic TG, Gendreau M, Farvolden JM (2000) A simplex-based tabu search method for capacitated network design. INFORMS J Comput 12(3):223\u2013236","journal-title":"INFORMS J Comput"},{"key":"19_CR21","unstructured":"Dash Optimization Ltd (2000) Application of optimization with Xpress MP. http:\/\/www. dashoptimization.com\/home\/downloads\/book\/booka4.pdf"},{"issue":"3","key":"19_CR22","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/0004-3702(87)90091-9","volume":"32","author":"E Davis","year":"1987","unstructured":"Davis E (1987) Constraint propogation with interval labels. Artific Intell 32(3):281\u2013331","journal-title":"Artific Intell"},{"key":"19_CR23","doi-asserted-by":"crossref","unstructured":"Demassey S, Pesant G, Rousseau L-M (2005) Constraint programming based column generation for employee timetabling. In: Bartak R, Milano M (eds) Proceedings of the international conference on integration of AI and OR techniques in constraint programming for combinatorial optimization problems \u2013 CPAIOR, vol 3524 of LNCS. Springer, Berlin Heidelberg New York, pp 140\u2013154","DOI":"10.1007\/11493853_12"},{"key":"19_CR24","doi-asserted-by":"crossref","unstructured":"Deransart P, Hermenegildo MV, Maluszynski J (2000) Analysis and visualisation tools for constraint programming, vol LNCS 1870. Springer, Berlin Heidelberg New York","DOI":"10.1007\/10722311"},{"issue":"4","key":"19_CR25","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1023\/A:1009856210543","volume":"5","author":"H El Sakkout","year":"2000","unstructured":"El Sakkout H, Wallace M (2000) Probe backtrack search for minimal perturbation in dynamic scheduling. Constraints 5(4):359\u2013388","journal-title":"Constraints"},{"issue":"1","key":"19_CR26","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1023\/A:1013613701606","volume":"8","author":"T Fahle","year":"2002","unstructured":"Fahle T, Junker U, Karisch SE, Kohl N, Sellmann M, Vaaben B (2002) Constraint programming based column generation for crew assignment. J Heurist 8(1):59\u201381","journal-title":"J Heurist"},{"key":"19_CR27","doi-asserted-by":"crossref","unstructured":"Focacci F, Laburthe F, Lodi A (2003) Local search and constraint programming \u2013 ls and cp illustrated on a transportation problem. In: Milano M (ed) Constraint and integer programming \u2013 toward a unified methodology, chap 9. Kluwer Dordrecht","DOI":"10.1007\/978-1-4419-8917-8_9"},{"key":"19_CR28","doi-asserted-by":"crossref","unstructured":"Focacci F, Lodi A, Milano M (1999) Cost-based domain filtering. In: Jaffar J (ed) Proceedings of the international conference on principles and practice of constraint programming CP\u201999, vol 1713 of \u201cLNCS\u201d. Springer, Berlin Heidelberg New York, pp 189\u2013203","DOI":"10.1007\/978-3-540-48085-3_14"},{"key":"19_CR29","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/S0004-3702(98)00105-2","volume":"107","author":"E Freuder","year":"1999","unstructured":"Freuder E, R\u00e9gin JC (1999) Using constraint metaknowledge to reduce arc-consistency computation. Artific Intell 107:125\u2013148","journal-title":"Artific Intell"},{"key":"19_CR30","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/S0743-1066(98)10005-5","volume":"37","author":"T Fruhwirth","year":"1998","unstructured":"Fruhwirth T (1998) Theory and practice of constraint handling rules. J Logic Program Spec Issue Constraint Logic Program, 37:95\u2013138","journal-title":"J Logic Program Spec Issue Constraint Logic Program,"},{"key":"19_CR31","doi-asserted-by":"crossref","unstructured":"Gendron B, Lebbah H, Pesant G (2005) Improving the cooperation between the master problem and the subproblem in constraint programming based column generation. In: Bartak R, Milano M (eds) Proceedings of the international conference on integration of AI and OR techniques in constraint programming for combinatorial optimization problems \u2013 CPAIOR, vol 3524 of LNCS. Springer, Berlin Heidelberg New York, pp 217\u2013227","DOI":"10.1007\/11493853_17"},{"key":"19_CR32","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1287\/ijoc.13.4.258.9733","volume":"13","author":"IE Grossmann","year":"2001","unstructured":"Grossmann IE, Jain V (2001) Algorithms for hybrid milp\/cp models for a class of optimization problems. INFORMS J Comput 13:258\u2013276","journal-title":"INFORMS J Comput"},{"key":"19_CR33","unstructured":"Harvey WD, Ginsberg ML (1995) Limited discrepancy search. In: Mellish CS (ed) Proceedings of the fourteenth international joint conference on artificial intelligence (IJCAI-95), Vol 1, pp 607\u2013615"},{"key":"19_CR34","doi-asserted-by":"crossref","unstructured":"Hooker JN (2004) A hybrid method for planning and scheduling. In: Wallace M (ed) Proceedings of the international conference on principles and practice of constraint programming \u2013 CP 2004, vol 3258 of \u201cLNCS\u201d. Springer, Berlin Heidelberg New York, pp 305\u2013316","DOI":"10.1007\/978-3-540-30201-8_24"},{"key":"19_CR35","doi-asserted-by":"crossref","unstructured":"Hooker JN (2005) Planning and scheduling to minimize tardiness. In: Van Beek P (ed) Proceedings of the international conference on principles and practice of constraint programming \u2013 CP 2005, vol 3709 of \u201cLNCS\u201d. Springer, Berlin Heidelberg New York, pp 314\u2013327","DOI":"10.1007\/11564751_25"},{"key":"19_CR36","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/s10107-003-0375-9","volume":"96","author":"JN Hooker","year":"2003","unstructured":"Hooker JN, Ottosson G (2003) Logic-based Benders decomposition. Math Program 96:33\u201360","journal-title":"Math Program"},{"key":"19_CR37","unstructured":"ILOG Optimization Team (2003) Concert technology"},{"key":"19_CR38","unstructured":"ILOG Optimization Team (2005) Cplex 10.0 user manual"},{"key":"19_CR39","doi-asserted-by":"crossref","first-page":"1325","DOI":"10.1002\/1097-024X(200009)30:11<1325::AID-SPE342>3.0.CO;2-T","volume":"30","author":"M Junger","year":"2000","unstructured":"Junger M, Thienel S (2000) The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization. Softw Pract Exp 30:1325\u20131352","journal-title":"Softw Pract Exp"},{"key":"19_CR40","doi-asserted-by":"crossref","unstructured":"Kamarainen O, El Sakkout H (2002) Local probing applied to scheduling. In: Van Hentenryck P (ed) Proceedings of the international conference on principles and practice of constraint programming, vol 2470 of \u201cLNCS\u201d. Springer, Berlin Heidelberg New York, pp 155\u2013171","DOI":"10.1007\/3-540-46135-3_11"},{"issue":"3\u20134","key":"19_CR41","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1023\/A:1020565317875","volume":"7","author":"F Laburthe","year":"2002","unstructured":"Laburthe F, Caseau Y (2002) Salsa: a language for search algorithms. Constraints 7(3\u20134):255\u2013288","journal-title":"Constraints"},{"key":"19_CR43","doi-asserted-by":"crossref","unstructured":"Langley P (1992) Systematic and nonsystematic search strategies. In: Hendler J (ed) Proceedings of the 1st international conference on AI planning systems, AIPS. Morgan Kaufmann pp 145\u2013152","DOI":"10.1016\/B978-0-08-049944-4.50022-7"},{"key":"19_CR44","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/0167-6377(93)90002-X","volume":"13","author":"G Laporte","year":"1993","unstructured":"Laporte G, Louveaux FV (1993) The integer l-shaped method for stochastic integer programs with complete recourse. Oper Res Lett 13:133\u2013142","journal-title":"Oper Res Lett"},{"key":"19_CR45","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/0004-3702(78)90029-2","volume":"10","author":"JL Lauri\u00e8re","year":"1978","unstructured":"Lauri\u00e8re JL (1978) A language and a program for stating and solving combinatorial problems. Artif Intell 10:29\u2013127","journal-title":"Artif Intell"},{"key":"19_CR42","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1007\/s10288-002-0003-1","volume":"1","author":"C Lemar\u00e9chal","year":"2003","unstructured":"Lemar\u00e9chal C (2003) The omnipresence of Lagrange. 4OR 1:7\u201325","journal-title":"4OR"},{"key":"19_CR46","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1016\/0743-1066(93)90047-K","volume":"16","author":"T Le Provost","year":"1993","unstructured":"Le Provost T, Wallace M (1993) Generalized constraint propagation over the clp scheme. J Logic Program 16:319\u2013359","journal-title":"J Logic Program"},{"issue":"2","key":"19_CR47","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1287\/opre.21.2.498","volume":"21","author":"S Lin","year":"1973","unstructured":"Lin S, Kernighan B (1973) An efficient heuristic for the traveling salesman problem. Oper Res 21(2):498\u2013516","journal-title":"Oper Res"},{"issue":"1-2","key":"19_CR48","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1023\/A:1009818401322","volume":"5","author":"L Michel","year":"2000","unstructured":"Michel L, Van Hentenryck P (2000) Localizer. Constraints 5(1-2):43\u201384","journal-title":"Constraints"},{"key":"19_CR49","first-page":"407","volume":"83","author":"VI Norkin","year":"1998","unstructured":"Norkin VI, Pflug GC, Ruszczynski A (1998) A branch and bound method for stochastic global optimization. Math Program 83:407\u2013423","journal-title":"Math Program"},{"issue":"6","key":"19_CR50","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1287\/mnsc.42.6.797","volume":"42","author":"E Nowicki","year":"1996","unstructured":"Nowicki E, Smutnicki C (1996) A fast taboo search algorithm for the job shop problem. Manage Sci 42(6):797\u2013813","journal-title":"Manage Sci"},{"key":"19_CR51","doi-asserted-by":"crossref","unstructured":"Ouaja W, Richards B (2005) Hybrid lagrangian relaxation for bandwidth-constrained routing: knapsack decomposition. In: Proceedings of 2005 ACM symposium on applied computing, pp 383\u2013387","DOI":"10.1145\/1066677.1066766"},{"key":"19_CR52","doi-asserted-by":"crossref","unstructured":"Perron L, Shaw P, Furnon V (2004) Propagation guided large neighborhood search. In: Wallace M (ed) \u201cProceedings of the international conference on principles and practice of constraint programming CP2004\u201d, vol 3258 of \u201cLNCS\u201d. Springer, Berlin Heidelberg New York, pp 468\u2013481","DOI":"10.1007\/978-3-540-30201-8_35"},{"issue":"3","key":"19_CR53","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1023\/A:1009694016861","volume":"5","author":"G Pesant","year":"1999","unstructured":"Pesant G, Gendreau M (1999) A constraint programming framework for local search methods. J Heurist 5(3):255\u2013279","journal-title":"J Heurist"},{"key":"19_CR54","doi-asserted-by":"crossref","unstructured":"Refalo P (2000) Linear formulation of constraint programming models and hybrid solvers. In: Dechter R (ed) Proceedings of the international conference on principle and practice of constraint programming \u2013 CP 2000, vol 1894 of \u201cLNCS\u201d. Springer, Berlin Heidelberg New York","DOI":"10.1007\/3-540-45349-0_27"},{"key":"19_CR55","unstructured":"R\u00e9gin JC (1994) A filtering algorithm for constraints of difference in CSPs. In: Hayes-Roth B, Korf R (eds) Proceedings of the national conference on artificial intelligence - AAAI94, pp 362\u2013367"},{"key":"19_CR56","doi-asserted-by":"crossref","unstructured":"R\u00e9gin JC (1999) Arc consistency for global cardinality constraints with costs. In: Jaffar J (ed) Proceedings of the international conference on principles and practice of constraint programming, CP\u201999, vol 1713 of \u201cLNCS\u201d. Springer, Berlin Heidelberg New York, pp 390\u2013404","DOI":"10.1007\/978-3-540-48085-3_28"},{"key":"19_CR57","doi-asserted-by":"crossref","unstructured":"Regin JC (2004) Global constraints and filtering algorithms. In: Milano M (ed) Constraint and integer programming. Kluwer Dordrecht","DOI":"10.1007\/978-1-4419-8917-8_4"},{"key":"19_CR58","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1023\/A:1018904229454","volume":"86","author":"R Rodosek","year":"1999","unstructured":"Rodosek R, Wallace M, Hajian MT (1999) A new approach to integrating mixed integer programming and constraint logic programming, Recent advances in combinatorial. Ann Oper Res 86:63\u201387","journal-title":"Ann Oper Res"},{"issue":"5","key":"19_CR59","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1002\/spe.4380230507","volume":"23","author":"M Sannella","year":"1993","unstructured":"Sannella M, Maloney J, Freeman-Benson B, Borning A (1993) Multi-way versus one-way constraints in user interfaces: experience with the DeltaBlue algorithm. Softw Pract Exp 23(5): 529\u2013566","journal-title":"Softw Pract Exp"},{"issue":"3","key":"19_CR60","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1145\/1065887.1065889","volume":"27","author":"C Schulte","year":"2005","unstructured":"Schulte C, Stuckey PJ (2005) When do bounds and domain propagation lead to the same search space. ACM Trans Program Lang Syst 27(3):388\u2013425","journal-title":"ACM Trans Program Lang Syst"},{"key":"19_CR61","first-page":"417","volume-title":"Proceedings of the international conference on principles and practice of constraint programming CP1998, vol 1520 of \u201cLNCS\u201d","author":"P Shaw","year":"1998","unstructured":"Shaw P (1998) Using constraint programming and local search methods to solve vehicle routing problems. In: Maher M, Puget JF (eds) Proceedings of the international conference on principles and practice of constraint programming CP1998, vol 1520 of \u201cLNCS\u201d. Springer, Berlin Heidelberg New York, pp 417\u2013431"},{"issue":"2","key":"19_CR62","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1287\/trsc.1030.0078","volume":"39","author":"AV Moura","year":"2005","unstructured":"Moura AV, Yunes TH, de Souza CC (2005) Hybrid column generation approaches for urban transit crew management problems. Transportation Sci 39(2):273\u2013288","journal-title":"Transportation Sci"},{"key":"19_CR63","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1007\/s10601-006-6849-7","volume":"11","author":"A Tarim","year":"2006","unstructured":"Tarim A, Manandhar S, Walsh T (2006) Stochastic constraint programming: a scenario-based approach. Constraints 11:53\u201380","journal-title":"Constraints"},{"key":"19_CR64","volume-title":"The OPL optimization programming language","author":"P Hentenryck Van","year":"1999","unstructured":"Van Hentenryck P (1999) The OPL optimization programming language. MIT Press, Cambridge"},{"key":"19_CR65","volume-title":"Constraint-based local search","author":"P Hentenryck Van","year":"2005","unstructured":"Van Hentenryck P, Michel L (2005) Constraint-based local search. MIT Press, Cambridge"},{"key":"19_CR66","unstructured":"Van Hoeve WJ (2006) The alldifferent constraint: a systematic overview, 2006. URL www.cs.cornell.edu\/ vanhoeve\/papers\/alldiff.pdfWalsh T (2002) Stochastic constraint programming. In: van Harmelen F (ed) Proceedings of the European conference on artificial intelligence, ECAI, IOS Press"},{"key":"19_CR67","doi-asserted-by":"crossref","unstructured":"Zhou NF (2005) Finite-domain constraint propagators in action rules. Theory Pract Logic Program, (to appear)","DOI":"10.1017\/S1471068405002590"}],"container-title":["4OR"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-006-0019-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10288-006-0019-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-006-0019-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,8]],"date-time":"2023-05-08T16:04:59Z","timestamp":1683561899000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10288-006-0019-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,8,24]]},"references-count":67,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2006,9]]}},"alternative-id":["19"],"URL":"https:\/\/doi.org\/10.1007\/s10288-006-0019-z","relation":{},"ISSN":["1619-4500","1614-2411"],"issn-type":[{"value":"1619-4500","type":"print"},{"value":"1614-2411","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,8,24]]}}}