{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,2]],"date-time":"2025-11-02T16:24:59Z","timestamp":1762100699951},"publisher-location":"Berlin, Heidelberg","reference-count":63,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540738169"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73817-6_1","type":"book-chapter","created":{"date-parts":[[2007,8,18]],"date-time":"2007-08-18T03:59:13Z","timestamp":1187409553000},"page":"1-32","source":"Crossref","is-referenced-by-count":1,"title":["Hybrid Algorithms in Constraint Programming"],"prefix":"10.1007","author":[{"given":"Mark","family":"Wallace","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"1_CR1","unstructured":"Azarmi, N., Abdul-Hameed, W.: Workforce scheduling with constraint logic programming. BT Technology Journal\u00a013(1) (1995)"},{"key":"1_CR2","unstructured":"Ans\u00f3tegui, C., del Val, A., Dot\u00fa, I., Fern\u00e0ndez, C., Many\u00e0, F.: Modeling choices in quasigroup completion: Sat vs. csp. In: AAAI, pp. 137\u2013142 (2004)"},{"key":"1_CR3","volume-title":"Constraint Logic Programming Using ECLiPSe","author":"K. Apt","year":"2006","unstructured":"Apt, K., Wallace, M.: Constraint Logic Programming Using ECLiPSe. Cambridge University Press, Cambridge (2006)"},{"key":"1_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1007\/3-540-49481-2_34","volume-title":"Principles and Practice of Constraint Programming - CP98","author":"N. Barnier","year":"1998","unstructured":"Barnier, N., Brisset, P.: Combine and conquer: Genetic algorithm and cp for optimization. In: Maher, M.J., Puget, J.-F. (eds.) Principles and Practice of Constraint Programming - CP98. LNCS, vol.\u00a01520, p. 463. Springer, Heidelberg (1998)"},{"key":"1_CR5","unstructured":"Beldiceanu, N., Bourreau, E., Chan, P., Rivreau, D.: Partial search strategy in CHIP. In: Proceedings of the 2nd. International Conference on Meta-Heuristics (1997)"},{"volume-title":"Search Methodologies: Introductory Tutorials in Optimization and Decision Support Methodologies","year":"2006","key":"1_CR6","unstructured":"Burke, E., Kendall, G. (eds.): Search Methodologies: Introductory Tutorials in Optimization and Decision Support Methodologies. Springer, Heidelberg (2006)"},{"key":"1_CR7","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1023\/A:1021849405707","volume":"118","author":"C. Beck","year":"2003","unstructured":"Beck, C., Refalo, P.: A Hybrid Approach to Scheduling with Earliness and Tardiness Costs. Annals of Operations Research\u00a0118, 49\u201371 (2003)","journal-title":"Annals of Operations Research"},{"key":"1_CR8","unstructured":"Cronholm, W., Ajili, F.: Hybrid branch-and-price for multicast network design. In: INOC 2005. Proceedings of the 2nd International Network Optimization Conference, pp. 796\u2013802 (2005)"},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"Caseau, Y., Laburthe, F.: Heuristics for large constrained vehicle routing problems. Journal of Heuristics\u00a05(3) (1999)","DOI":"10.1023\/A:1009661600931"},{"issue":"1","key":"1_CR10","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1017\/S0269888901000078","volume":"16","author":"Y. Caseau","year":"2001","unstructured":"Caseau, Y., Laburthe, F., Le Pape, C., Rottembourg, B.: Combining local and global search in a constraint programming environment. Knowl. Eng. Rev.\u00a016(1), 41\u201368 (2001)","journal-title":"Knowl. Eng. Rev."},{"issue":"1-2","key":"1_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0004-3702(00)00053-9","volume":"123","author":"K.M.F. Choi","year":"2000","unstructured":"Choi, K.M.F., Lee, J.H.M., Stuckey, P.J.: A lagrangian reconstruction of genet. Artif. Intell.\u00a0123(1-2), 1\u201339 (2000)","journal-title":"Artif. Intell."},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"Cheng, B.M.W., Lee, J.H.M., Wu, J.C.K.: Speeding up constraint propagation by redundant modeling. In: Principles and Practice of Constraint Programming, pp. 91\u2013103 (1996)","DOI":"10.1007\/3-540-61551-2_68"},{"issue":"3","key":"1_CR13","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/BF00137871","volume":"1","author":"K. Darby-Dowman","year":"1997","unstructured":"Darby-Dowman, K., Little, J., Mitra, G., Zaffalon, M.: Constraint logic programming and integer programming approaches and their collaboration in solving an assignment scheduling problem. Constraints\u00a01(3), 245\u2013264 (1997)","journal-title":"Constraints"},{"issue":"2","key":"1_CR14","first-page":"1381","volume":"3","author":"S. Mehta","year":"2004","unstructured":"Mehta, S., Demirkol, E., Uzsoy, R.: A computational study of shifting bottleneck procedures for shop scheduling problems. Journal of Heuristics\u00a03(2), 1381\u20131231 (2004)","journal-title":"Journal of Heuristics"},{"key":"1_CR15","series-title":"Lecture Notes in Computer Science","volume-title":"Practice and Theory of Automated Timetabling IV","author":"K. Easton","year":"2003","unstructured":"Easton, K., Nemhauser, G., Trick, M.: Solving the Travelling Tournament Problem: A Combined Integer Programming and Constraint Programming Approach. In: Burke, E.K., De Causmaecker, P. (eds.) PATAT 2002. LNCS, vol.\u00a02740, Springer, Heidelberg (2003)"},{"key":"1_CR16","doi-asserted-by":"crossref","unstructured":"El Sakkout, H., Wallace, M.: Probe backtrack search for minimal perturbation in dynamic scheduling. Constraints\u00a05(4) (2000)","DOI":"10.1023\/A:1009856210543"},{"key":"1_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-45578-7_1","volume-title":"Principles and Practice of Constraint Programming - CP 2001","author":"A. Eremin","year":"2001","unstructured":"Eremin, A., Wallace, M.: Hybrid benders decomposition algorithms in constraint logic programming. In: Walsh, T. (ed.) CP 2001. LNCS, vol.\u00a02239, pp. 1\u201315. Springer, Heidelberg (2001)"},{"key":"1_CR18","series-title":"Operations Research\/Computer Science Interfaces Series","volume-title":"Constraint and Integer Programming Toward a Unified Methodology, ch. 9","author":"F. Focacci","year":"2004","unstructured":"Focacci, F., Laburthe, F., Lodi, A.: Local search and constraint programming. In: Constraint and Integer Programming Toward a Unified Methodology, ch. 9. Operations Research\/Computer Science Interfaces Series, vol.\u00a027, Springer, Heidelberg (2004)"},{"key":"1_CR19","series-title":"Operations Research\/Computer Science Interfaces Series","volume-title":"Constraint and Integer Programming Toward a Unified Methodology, ch. 5","author":"F. Focacci","year":"2004","unstructured":"Focacci, F., Lodi, A., Milano, M.: Exploiting relaxations in CP. In: Constraint and Integer Programming Toward a Unified Methodology, ch. 5. Operations Research\/Computer Science Interfaces Series, vol.\u00a027, Springer, Heidelberg (2004)"},{"key":"1_CR20","unstructured":"Gaschnig, J.: A constraint satisfaction method for inference making. In: Proc. 12th Annual Allerton Conf. on Circuit System Theory, pp. 866\u2013874, Univ. Illinois (1974)"},{"key":"1_CR21","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1090\/dimacs\/057\/09","volume":"57","author":"C. Gervet","year":"2001","unstructured":"Gervet, C.: Large scale combinatorial optimization: A methodological viewpoint. DIMACS Series in Discrete Mathematics and Computers Science\u00a057, 151\u2013175 (2001)","journal-title":"DIMACS Series in Discrete Mathematics and Computers Science"},{"issue":"1","key":"1_CR22","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1287\/opre.49.1.163.11193","volume":"49","author":"M. Henz","year":"2001","unstructured":"Henz, M.: Scheduling a major college basketball conference\u2013revisited. Oper. Res.\u00a049(1), 163\u2013168 (2001)","journal-title":"Oper. Res."},{"key":"1_CR23","unstructured":"Harvey, W.D., Ginsberg, M.L.: Limited discrepancy search. In: Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, pp. 607\u2013615 (1995)"},{"key":"1_CR24","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1016\/j.ejor.2004.01.027","volume":"162","author":"J. Homberger","year":"2005","unstructured":"Homberger, J., Gehring, H.: A two-phase hybrid metaheuristic for the vehicle routing problem with time windows. Eur. J. Oper. Res.\u00a0162, 220\u2013238 (2005)","journal-title":"Eur. J. Oper. Res."},{"key":"1_CR25","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1016\/S0166-218X(99)00100-6","volume":"96-97","author":"J.N. Hooker","year":"1999","unstructured":"Hooker, J.N., Osorio, M.A.: Mixed logical \/ linear programming. Discrete Applied Mathematics\u00a096-97, 395\u2013442 (1999)","journal-title":"Discrete Applied Mathematics"},{"key":"1_CR26","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/s10107-003-0375-9","volume":"96","author":"J.N. Hooker","year":"2003","unstructured":"Hooker, J.N., Ottosson, G.: Logic-based Benders decomposition. Mathematical Programming\u00a096, 33\u201360 (2003)","journal-title":"Mathematical Programming"},{"key":"1_CR27","doi-asserted-by":"crossref","unstructured":"Hooker, J.N.: A Hybrid Method for Planning and Scheduling. Constraints\u00a010(4) (2005)","DOI":"10.1007\/s10601-005-2812-2"},{"issue":"4","key":"1_CR28","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1287\/ijoc.13.4.258.9733","volume":"13","author":"V. Jain","year":"2001","unstructured":"Jain, V., Grossmann, I.: Algorithms for Hybrid MILP\/CP Models for a Class of Optimization Problems. INFORMS Journal on Computing\u00a013(4), 258\u2013276 (2001)","journal-title":"INFORMS Journal on Computing"},{"key":"1_CR29","unstructured":"Jussien, N., Lhomme, O.: Local search with constraint propagation and conflict-based heuristics. In: AAAI 2000. Proceedings of the Seventh National Conference on Artificial Intelligence, Austin, TX, USA, August 2000, pp. 169\u2013174 (2000)"},{"key":"1_CR30","doi-asserted-by":"crossref","unstructured":"Kamarainen, O., El Sakkout, H.: Local probing applied to scheduling. In: Principles and Practice of Constraint Programming, pp. 155\u2013171 (2002)","DOI":"10.1007\/3-540-46135-3_11"},{"issue":"5","key":"1_CR31","doi-asserted-by":"publisher","first-page":"715","DOI":"10.1145\/1089023.1089024","volume":"52","author":"R.E. Korf","year":"2005","unstructured":"Korf, R.E., Zhang, W., Thayer, I., Hohwald, H.: Frontier search. J. ACM\u00a052(5), 715\u2013748 (2005)","journal-title":"J. ACM"},{"key":"1_CR32","unstructured":"Li, Y.: Directed Annealing Searc. In: Constraint Satisfaction and Optimisation. PhD thesis, IC-Parc (1997)"},{"key":"1_CR33","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1287\/opre.21.2.498","volume":"21","author":"S. Lin","year":"1973","unstructured":"Lin, S., Kernighan, B.W.: An effective heuristic algorithm for the traveling salesman problem. Operations Research\u00a021, 498\u2013516 (1973)","journal-title":"Operations Research"},{"key":"1_CR34","doi-asserted-by":"publisher","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N. Mladenovi\u0107","year":"1997","unstructured":"Mladenovi\u0107, N., Hansen, P.: Variable neighborhood search. Comps. in Opns. Res.\u00a024, 1097\u20131100 (1997)","journal-title":"Comps. in Opns. Res."},{"key":"1_CR35","volume-title":"Handbook of Constraint Programming","author":"K. Marriott","year":"2006","unstructured":"Marriott, K., Stuckey, P., Wallace, M.: Constraint logic programming. In: Rossi, van Beek, Walsh (eds.) Handbook of Constraint Programming, Elsevier, Amsterdam (2006)"},{"issue":"6","key":"1_CR36","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.: A fast taboo search algorithm for the job shop problem. Manage. Sci.\u00a042(6), 797\u2013813 (1996)","journal-title":"Manage. Sci."},{"issue":"3","key":"1_CR37","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1002\/net.10110","volume":"43","author":"W. Ouaja","year":"2004","unstructured":"Ouaja, W., Richards, E.B.: A hybrid multicommodity routing algorithm for traffic engineering. Networks\u00a043(3), 125\u2013140 (2004)","journal-title":"Networks"},{"issue":"3","key":"1_CR38","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1023\/A:1009694016861","volume":"5","author":"G. Pesant","year":"1999","unstructured":"Pesant, G., Gendreau, M.: A constraint programming framework for local search methods. Journal of Heuristics\u00a05(3), 255\u2013279 (1999)","journal-title":"Journal of Heuristics"},{"key":"1_CR39","unstructured":"Prestwich, S.: Three clp implementations of branch-and-bound optimization. In: Parallelism and Implementation of Logic and Constraint Logic Programming, vol.\u00a02, Nova Science Publishers, Inc. (1999)"},{"key":"1_CR40","unstructured":"Prestwich, S.: Combining the scalability of local search with the pruning techniques of systematic search. Annals of Operations Research\u00a0115 (2002)"},{"key":"1_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"240","DOI":"10.1007\/978-3-540-24664-0_17","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"C. Pralet","year":"2004","unstructured":"Pralet, C., Verfaillie, G.: Travelling in the world of local searches in the space of partial assignments. In: R\u00e9gin, J.-C., Rueher, M. (eds.) CPAIOR 2004. LNCS, vol.\u00a03011, pp. 240\u2013255. Springer, Heidelberg (2004)"},{"key":"1_CR42","unstructured":"ROADEF (2007)"},{"key":"1_CR43","volume-title":"Meta-Heuristics: Theory and Applications","author":"C. Rego","year":"1996","unstructured":"Rego, C., Roucairol, C.: A parallel tabu search algorithm using ejection chains for vehicle routing. In: Meta-Heuristics: Theory and Applications, Kluwer, Dordrecht (1996)"},{"key":"1_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/3-540-49481-2_28","volume-title":"Principles and Practice of Constraint Programming - CP98","author":"R. Rodosek","year":"1998","unstructured":"Rodosek, R., Wallace, M.G.: A generic model and hybrid algorithm for hoist scheduling problems. In: Maher, M.J., Puget, J.-F. (eds.) Principles and Practice of Constraint Programming - CP98. LNCS, vol.\u00a01520, pp. 385\u2013399. Springer, Heidelberg (1998)"},{"key":"1_CR45","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1023\/A:1018904229454","volume":"86","author":"R. Rodosek","year":"1999","unstructured":"Rodosek, R., Wallace, M.G., Hajian, M.: A new approach to integrating mixed integer programming with constraint logic programming. Annals of Operations research\u00a086, 63\u201387 (1999)","journal-title":"Annals of Operations research"},{"key":"1_CR46","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1023\/A:1021101321339","volume":"115","author":"D. Riera","year":"2002","unstructured":"Riera, D., Yorke-Smith, N.: An Improved Hybrid Model for the Generic Hoist Scheduling Problem. Annals of Operations Research\u00a0115, 173\u2013191 (2002)","journal-title":"Annals of Operations Research"},{"key":"1_CR47","series-title":"Lecture Notes in Computer Science","volume-title":"Principles and Practice of Constraint Programming - CP \u201995","author":"B. Smith","year":"1995","unstructured":"Smith, B., Brailsford, S., Hubbard, P., Williams, H.P.: The Progressive Party Problem: Integer Linear Programming and Constraint Programming Compared. In: Montanari, U., Rossi, F. (eds.) CP 1995. LNCS, vol.\u00a0976, Springer, Heidelberg (1995)"},{"key":"1_CR48","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1023\/A:1021845304798","volume":"118","author":"M. Sellmann","year":"2003","unstructured":"Sellmann, M., Fahle, T.: Constraint programming based lagrangian relaxation for the automatic recording problem. Annals of Operations Research\u00a0118, 17\u201333 (2003)","journal-title":"Annals of Operations Research"},{"key":"1_CR49","volume-title":"Artificial Intelligence: A Modern Approach, ch. 4","author":"P. Norvig","year":"1995","unstructured":"Norvig, P., Russell, S.: Informed Search and Exploration. In: Artificial Intelligence: A Modern Approach, ch. 4, Prentice-Hall, Englewood Cliffs (1995)"},{"issue":"1","key":"1_CR50","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1023\/A:1008287028851","volume":"12","author":"Y. Shang","year":"1998","unstructured":"Shang, Y., Wah, B.: A discrete lagrangian-based global-search method for solving satisfiability problems. Journal of Global Optimization\u00a012(1), 61\u2013100 (1998)","journal-title":"Journal of Global Optimization"},{"key":"1_CR51","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1023\/A:1021105422248","volume":"115","author":"M. Sellmann","year":"2002","unstructured":"Sellmann, M., Zervoudakis, K., Stamatopoulos, P., Fahle, T.: Crew assignment via constraint programming: Integrating column generation and heuristic tree search. Annals of Operations Research\u00a0115, 207\u2013226 (2002)","journal-title":"Annals of Operations Research"},{"key":"1_CR52","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1023\/A:1018977712248","volume":"81","author":"M.T. Hajian","year":"1998","unstructured":"Hajian, M.T., El-Sakkout, H.H., Wallace, M.G., Richards, E.B., Lever, J.M.: Towards a closer integration of finite domain propagation and simplex-based algorithms. Annals of Operations Research\u00a081, 421\u2013431 (1998)","journal-title":"Annals of Operations Research"},{"key":"1_CR53","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/S0004-3702(98)00053-8","volume":"103","author":"P. Van Hentenryck","year":"1998","unstructured":"Van Hentenryck, P.: A gentle introduction to Numerica. Artificial Intelligence\u00a0103, 209\u2013235 (1998)","journal-title":"Artificial Intelligence"},{"key":"1_CR54","unstructured":"Van Hentenryck, P., Carillon, J.-P.: Generality versus specificity: An experience with ai and or techniques. In: AAAI, pp. 660\u2013664 (1988)"},{"key":"1_CR55","first-page":"41","volume":"5","author":"P. Van Hentenryck","year":"2000","unstructured":"Van Hentenryck, P., Michel, L.: Localizer: A Modeling Language for Local Search. Constraints\u00a05, 41\u201382 (2000)","journal-title":"Constraints"},{"key":"1_CR56","volume-title":"Constraint-Based Local Search","author":"P. Van Hentenryck","year":"2005","unstructured":"Van Hentenryck, P., Michel, L.: Constraint-Based Local Search. MIT Press, Cambridge (2005)"},{"key":"1_CR57","unstructured":"Verfaillie, G., Schiex, T.: Solution reuse in dynamic constraint satisfaction problems. In: AAAI 1994. Proceedings of the twelfth national conference on Artificial intelligence, vol.\u00a01, pp. 307\u2013312 (1994)"},{"key":"1_CR58","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1016\/S0377-2217(98)00099-X","volume":"113","author":"E. Voudouris","year":"1999","unstructured":"Voudouris, E., Tsang, E.P.K.: Guided Local Search. European Journal of Operational Research\u00a0113, 469\u2013499 (1999)","journal-title":"European Journal of Operational Research"},{"key":"1_CR59","volume-title":"Model Building in Mathematical Programming","author":"H.P. Williams","year":"1999","unstructured":"Williams, H.P.: Model Building in Mathematical Programming. Wiley, Chichester (1999)"},{"issue":"4","key":"1_CR60","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1023\/A:1014450507312","volume":"34","author":"M.G. Wallace","year":"2002","unstructured":"Wallace, M.G., Schimpf, J.: Finding the right hybrid algorithm - a combinatorial meta-problem. Annals of Mathematics and Artificial Intelligence\u00a034(4), 259\u2013269 (2002)","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"issue":"2","key":"1_CR61","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1287\/trsc.1030.0078","volume":"39","author":"T.H. Yunes","year":"2002","unstructured":"Yunes, T.H., Moura, A.V., de Souza, C.C.: Hybrid Column Generation Approaches for Urban Transit Crew Management Problems. Transportation Science\u00a039(2), 273\u2013288 (2002)","journal-title":"Transportation Science"},{"key":"1_CR62","unstructured":"Yokoo, M.: Weak-commitment search for solving constraint satisfaction problems. In: AAAI 1994. Proceedings of the 12th National Conference on Artificial Intelligence, Seattle, WA, USA, pp. 313\u2013318 (1994)"},{"key":"1_CR63","first-page":"279","volume-title":"ICCAD 2001","author":"L. Zhang","year":"2001","unstructured":"Zhang, L., Madigan, C.F., Moskewicz, M.H., Malik, S.: Efficient conflict driven learning in a boolean satisfiability solver. In: ICCAD 2001. Proceedings of the 2001 IEEE\/ACM international conference on Computer-aided design, pp. 279\u2013285. ACM Press, New York (2001)"}],"container-title":["Lecture Notes in Computer Science","Recent Advances in Constraints"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73817-6_1.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:00:31Z","timestamp":1619517631000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73817-6_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540738169"],"references-count":63,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73817-6_1","relation":{},"subject":[]}}