{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,13]],"date-time":"2025-10-13T09:16:26Z","timestamp":1760346986755,"version":"3.40.3"},"publisher-location":"Cham","reference-count":45,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030770907"},{"type":"electronic","value":"9783030770914"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-77091-4_20","type":"book-chapter","created":{"date-parts":[[2021,5,21]],"date-time":"2021-05-21T16:03:21Z","timestamp":1621613001000},"page":"318-334","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Improving the Efficiency of Euclidean TSP Solving in Constraint Programming by Predicting Effective Nocrossing Constraints"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3717-3779","authenticated-orcid":false,"given":"Elena","family":"Bellodi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2390-0629","authenticated-orcid":false,"given":"Alessandro","family":"Bertagnon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7433-5899","authenticated-orcid":false,"given":"Marco","family":"Gavanelli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8352-6304","authenticated-orcid":false,"given":"Riccardo","family":"Zese","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,5,22]]},"reference":[{"key":"20_CR1","unstructured":"Abadi, M., et al.: Tensorflow: Large-scale machine learning on heterogeneous distributed systems. arXiv preprint arXiv:1603.04467 (2016)"},{"key":"20_CR2","doi-asserted-by":"publisher","unstructured":"Aggarwal, C.: Neural Networks and Deep Learning - A Textbook. Springer, Heidelberg (2018). https:\/\/doi.org\/10.1007\/978-3-319-94463-0","DOI":"10.1007\/978-3-319-94463-0"},{"key":"20_CR3","unstructured":"Amrehn, M., Mualla, F., Angelopoulou, E., Steidl, S., Maier, A.: The random forest classifier in WEKA: discussion and new developments for imbalanced data (2019)"},{"key":"20_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/3-540-45586-8_7","volume-title":"Computational Combinatorial Optimization","author":"D Applegate","year":"2001","unstructured":"Applegate, D., Bixby, R., Chv\u00e1tal, V., Cook, W.: TSP cuts which do not conform to the template paradigm. In: J\u00fcnger, M., Naddef, D. (eds.) Computational Combinatorial Optimization. LNCS, vol. 2241, pp. 261\u2013303. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45586-8_7"},{"key":"20_CR5","unstructured":"Arora, S.: Polynomial time approximation schemes for Euclidean TSP and other geometric problems. In: Proceedings of 37th Conference on Foundations of Computer Science, pp. 2\u201311, October 1996"},{"key":"20_CR6","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/978-3-319-50137-6_4","volume-title":"Data Mining and Constraint Programming","author":"N Beldiceanu","year":"2016","unstructured":"Beldiceanu, N., Simonis, H.: ModelSeeker: extracting global constraint models from positive examples. In: Bessiere, C., De Raedt, L., Kotthoff, L., Nijssen, S., O\u2019Sullivan, B., Pedreschi, D. (eds.) Data Mining and Constraint Programming. LNCS (LNAI), vol. 10101, pp. 77\u201395. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-50137-6_4"},{"key":"20_CR7","unstructured":"Bellodi, E., Bertagnon, A., Gavanelli, M., Zese, R.: Improving the efficiency of euclidean TSP solving in constraint programming by predicting effective nocrossing constraints. In: Benedictis, R.D., et al. (eds.) Joint Proceedings of the 8th Italian Workshop on Planning and Scheduling and the 27th International Workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion co-located with AIxIA 2020, Online Event, November 25\u201327, 2020. CEUR Workshop Proceedings, vol. 2745. CEUR-WS.org (2020). http:\/\/ceur-ws.org\/Vol-2745\/paper6.pdf"},{"key":"20_CR8","doi-asserted-by":"crossref","unstructured":"Benchimol, P., van Hoeve, W.J., R\u00e9gin, J., Rousseau, L., Rueher, M.: Improved filtering for weighted circuit constraints. Constraints 17(3), 205\u2013233 (2012)","DOI":"10.1007\/s10601-012-9119-x"},{"key":"20_CR9","doi-asserted-by":"crossref","unstructured":"Bertagnon, A., Gavanelli, M.: Improved filtering for the Euclidean traveling salesperson problem in CLP(FD). In: The Thirty-Fourth AAAI Conference on Artificial Intelligence, AAAI 2020, The Thirty-Second Innovative Applications of Artificial Intelligence Conference, IAAI 2020, The Tenth AAAI Symposium on Educational Advances in Artificial Intelligence, EAAI 2020, New York, NY, USA, 7\u201312 February 2020, pp. 1412\u20131419. AAAI Press (2020). https:\/\/aaai.org\/ojs\/index.php\/AAAI\/article\/view\/5498","DOI":"10.1609\/aaai.v34i02.5498"},{"key":"20_CR10","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/978-3-319-50137-6_3","volume-title":"Data Mining and Constraint Programming","author":"C Bessiere","year":"2016","unstructured":"Bessiere, C., et al.: New approaches to constraint acquisition. In: Bessiere, C., De Raedt, L., Kotthoff, L., Nijssen, S., O\u2019Sullivan, B., Pedreschi, D. (eds.) Data Mining and Constraint Programming. LNCS (LNAI), vol. 10101, pp. 51\u201376. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-50137-6_3"},{"key":"20_CR11","doi-asserted-by":"publisher","unstructured":"Bessiere, C., et al. (eds.): Data Mining and Constraint Programming. LNCS (LNAI), vol. 10101. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-50137-6","DOI":"10.1007\/978-3-319-50137-6"},{"key":"20_CR12","doi-asserted-by":"crossref","unstructured":"Breiman, L.: Random forests. Mach. Learn. 45(1), 5\u201332 (2001)","DOI":"10.1023\/A:1010933404324"},{"key":"20_CR13","doi-asserted-by":"crossref","unstructured":"Caseau, Y., Laburthe, F.: Solving small TSPs with constraints. In: Naish, L. (ed.) Logic Programming, Proceedings of the Fourteenth International Conference on Logic Programming, Leuven, Belgium, 8\u201311 July 1997, pp. 316\u2013330. MIT Press (1997)","DOI":"10.7551\/mitpress\/4299.003.0028"},{"key":"20_CR14","doi-asserted-by":"crossref","unstructured":"Davis, J., Goadrich, M.: The relationship between precision-recall and ROC curves. In: European Conference on Machine Learning (ECML 2006). ACM (2006)","DOI":"10.1145\/1143844.1143874"},{"key":"20_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/978-3-319-93031-2_12","volume-title":"Integration of Constraint Programming, Artificial Intelligence, and Operations Research","author":"M Deudon","year":"2018","unstructured":"Deudon, M., Cournut, P., Lacoste, A., Adulyasak, Y., Rousseau, L.-M.: Learning heuristics for the TSP by policy gradient. In: van Hoeve, W.-J. (ed.) CPAIOR 2018. LNCS, vol. 10848, pp. 170\u2013181. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-93031-2_12"},{"key":"20_CR16","doi-asserted-by":"crossref","unstructured":"Edelsbrunner, H., Rote, G., Welzl, E.: Testing the necklace condition for shortest tours and optimal factors in the plane. Theor. Comput. Sci. 66(2), 157\u2013180 (1989)","DOI":"10.1016\/0304-3975(89)90133-3"},{"key":"20_CR17","unstructured":"Fages, J., Lorca, X.: Improving the asymmetric TSP by considering graph structure. CoRR abs\/1206.3437 (2012). http:\/\/arxiv.org\/abs\/1206.3437"},{"key":"20_CR18","doi-asserted-by":"publisher","unstructured":"Fages, J.-G., Lorca, X., Rousseau, L.-M.: The salesman and the tree: the importance of search in CP. Constraints 21(2), 145\u2013162 (2014). https:\/\/doi.org\/10.1007\/s10601-014-9178-2","DOI":"10.1007\/s10601-014-9178-2"},{"key":"20_CR19","doi-asserted-by":"crossref","unstructured":"Flood, M.M.: The traveling-salesman problem. Oper. Res. 4 (1956)","DOI":"10.1287\/opre.4.1.61"},{"key":"20_CR20","doi-asserted-by":"crossref","unstructured":"Focacci, F., Lodi, A., Milano, M.: Embedding relaxations in global constraints for solving TSP and TSPTW. Ann. Math. Artif. Intell. 34(4), 291\u2013311 (2002)","DOI":"10.1023\/A:1014492408220"},{"key":"20_CR21","doi-asserted-by":"crossref","unstructured":"Focacci, F., Lodi, A., Milano, M.: A hybrid exact algorithm for the TSPTW. INFORMS J. Comput. 14(4), 403\u2013417 (2002)","DOI":"10.1287\/ijoc.14.4.403.2827"},{"key":"20_CR22","doi-asserted-by":"publisher","unstructured":"Francis, K.G., Stuckey, P.J.: Explaining circuit propagation. Constraints 19(1), 1\u201329 (2013). https:\/\/doi.org\/10.1007\/s10601-013-9148-0","DOI":"10.1007\/s10601-013-9148-0"},{"key":"20_CR23","doi-asserted-by":"crossref","unstructured":"Garey, M.R., Graham, R.L., Johnson, D.S.: Some NP-complete geometric problems. In: Proceedings of the Eighth Annual ACM Symposium on Theory of Computing, STOC 1976, pp. 10\u201322. ACM, New York (1976)","DOI":"10.1145\/800113.803626"},{"key":"20_CR24","doi-asserted-by":"publisher","unstructured":"Gent, I.P., Miguel, I., Moore, N.C.A.: An empirical study of learning and forgetting constraints. AI Commun. 25(2) (2012). https:\/\/doi.org\/10.3233\/AIC-2012-0524","DOI":"10.3233\/AIC-2012-0524"},{"key":"20_CR25","unstructured":"Goodfellow, I., Bengio, Y., Courville, A.: Deep Learning. MIT Press (2016)"},{"key":"20_CR26","doi-asserted-by":"crossref","unstructured":"Held, M., Karp, R.M.: The traveling-salesman problem and minimum spanning trees. Oper. Res. 18, 1138\u20131162 (1970)","DOI":"10.1287\/opre.18.6.1138"},{"key":"20_CR27","doi-asserted-by":"crossref","unstructured":"Hutter, F., Xu, L., Hoos, H.H., Leyton-Brown, K.: Algorithm runtime prediction: methods & evaluation. Artif. Intell. 206, 79\u2013111 (2014)","DOI":"10.1016\/j.artint.2013.10.003"},{"key":"20_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1007\/978-3-030-30048-7_17","volume-title":"Principles and Practice of Constraint Programming","author":"N Isoart","year":"2019","unstructured":"Isoart, N., R\u00e9gin, J.-C.: Integration of structural constraints into TSP models. In: Schiex, T., de Givry, S. (eds.) CP 2019. LNCS, vol. 11802, pp. 284\u2013299. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-30048-7_17"},{"key":"20_CR29","doi-asserted-by":"publisher","unstructured":"Johnson, D.S., McGeoch, L.A.: Experimental analysis of heuristics for the STSP. In: Gutin, G., Punnen, A.P. (eds.) The Traveling Salesman Problem and its Variations, pp. 369\u2013443. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/0-306-48213-4_9","DOI":"10.1007\/0-306-48213-4_9"},{"key":"20_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"706","DOI":"10.1007\/11889205_55","volume-title":"Principles and Practice of Constraint Programming - CP 2006","author":"LG Kaya","year":"2006","unstructured":"Kaya, L.G., Hooker, J.N.: A filter for the circuit constraint. In: Benhamou, F. (ed.) CP 2006. LNCS, vol. 4204, pp. 706\u2013710. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11889205_55"},{"key":"20_CR31","doi-asserted-by":"crossref","unstructured":"Kerschke, P., Kotthoff, L., Bossek, J., Hoos, H.H., Trautmann, H.: Leveraging TSP solver complementarity through machine learning. Evol. Comput. 26(4), 597\u2013620 (2018)","DOI":"10.1162\/evco_a_00215"},{"key":"20_CR32","unstructured":"Kingma, D.P., Ba, J.: Adam: a method for stochastic optimization. In: Bengio, Y., LeCun, Y. (eds.) 3rd International Conference on Learning Representations, ICLR 2015, San Diego, CA, USA, 7\u20139 May 2015, Conference Track Proceedings (2015)"},{"key":"20_CR33","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/978-3-319-50137-6_7","volume-title":"Data Mining and Constraint Programming","author":"L Kotthoff","year":"2016","unstructured":"Kotthoff, L.: Algorithm selection for combinatorial search problems: a survey. In: Bessiere, C., De Raedt, L., Kotthoff, L., Nijssen, S., O\u2019Sullivan, B., Pedreschi, D. (eds.) Data Mining and Constraint Programming. LNCS (LNAI), vol. 10101, pp. 149\u2013190. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-50137-6_7"},{"key":"20_CR34","doi-asserted-by":"crossref","unstructured":"Lombardi, M., Milano, M.: Boosting combinatorial problem modeling with machine learning. In: Lang, J. (ed.) Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, IJCAI 2018, pp. 5472\u20135478. ijcai.org (2018)","DOI":"10.24963\/ijcai.2018\/772"},{"key":"20_CR35","doi-asserted-by":"publisher","unstructured":"Lombardi, M., Milano, M., Bartolini, A.: Empirical decision model learning. Artif. Intell. 244, 343\u2013367 (2017). https:\/\/doi.org\/10.1016\/j.artint.2016.01.005","DOI":"10.1016\/j.artint.2016.01.005"},{"key":"20_CR36","doi-asserted-by":"publisher","unstructured":"Mackworth, A.K.: Consistency in networks of relations. Artif. Intell. 8(1), 99\u2013118 (1977). https:\/\/doi.org\/10.1016\/0004-3702(77)90007-8","DOI":"10.1016\/0004-3702(77)90007-8"},{"key":"20_CR37","doi-asserted-by":"publisher","unstructured":"Mersmann, O., Bischl, B., Trautmann, H., Wagner, M., Bossek, J., Neuman, F.: A novel feature-based approach to characterize algorithm performance for the traveling salesperson problem. Ann. Math. Artif. Intell. 69(2), 151\u2013182 (2013). https:\/\/doi.org\/10.1007\/s10472-013-9341-2","DOI":"10.1007\/s10472-013-9341-2"},{"key":"20_CR38","doi-asserted-by":"crossref","unstructured":"Mitchell, J.S.B.: Guillotine subdivisions approximate polygonal subdivisions: a simple polynomial-time approximation scheme for geometric TSP, k-MST, and related problems. SIAM J. Comput. 28(4), 1298\u20131309 (1999)","DOI":"10.1137\/S0097539796309764"},{"key":"20_CR39","doi-asserted-by":"crossref","unstructured":"Pesant, G., Gendreau, M., Potvin, J., Rousseau, J.: An exact constraint logic programming algorithm for the traveling salesman problem with time windows. Transp. Sci. 32(1), 12\u201329 (1998)","DOI":"10.1287\/trsc.32.1.12"},{"key":"20_CR40","doi-asserted-by":"crossref","unstructured":"Pihera, J., Musliu, N.: Application of machine learning to algorithm selection for TSP. In: 2014 IEEE 26th International Conference on Tools with Artificial Intelligence, pp. 47\u201354. IEEE (2014)","DOI":"10.1109\/ICTAI.2014.18"},{"key":"20_CR41","doi-asserted-by":"crossref","unstructured":"Provost, F.J., Fawcett, T.: Robust classification for imprecise environments. Mach. Learn. 42(3), 203\u2013231 (2001)","DOI":"10.1023\/A:1007601015854"},{"key":"20_CR42","unstructured":"R\u00e9gin, J.: A filtering algorithm for constraints of difference in CSPs. In: Hayes-Roth, B., Korf, R.E. (eds.) Proceedings of the 12th National Conference on Artificial Intelligence, Seattle, WA, USA, 31 July\u20134 August 1994, vol. 1, pp. 362\u2013367. AAAI Press\/The MIT Press (1994)"},{"key":"20_CR43","doi-asserted-by":"crossref","unstructured":"Schimpf, J., Shen, K.: Ecl$${}^{\\text{i}}$$ps$${}^{\\text{ e }}$$ - from LP to CLP. TPLP 12(1\u20132), 127\u2013156 (2012)","DOI":"10.1017\/S1471068411000469"},{"key":"20_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1007\/978-3-642-13800-3_29","volume-title":"Learning and Intelligent Optimization","author":"K Smith-Miles","year":"2010","unstructured":"Smith-Miles, K., van Hemert, J., Lim, X.Y.: Understanding TSP difficulty by learning from evolved instances. In: Blum, C., Battiti, R. (eds.) LION 2010. LNCS, vol. 6073, pp. 266\u2013280. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13800-3_29"},{"key":"20_CR45","doi-asserted-by":"crossref","unstructured":"Witten, I.H., Frank, E., Hall, M.A.: Data Mining: Practical Machine Learning Tools and Techniques, 3rd edn. Morgan Kaufmann Series in Data Management Systems, Morgan Kaufmann (2011)","DOI":"10.1016\/B978-0-12-374856-0.00001-8"}],"container-title":["Lecture Notes in Computer Science","AIxIA 2020 \u2013 Advances in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-77091-4_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,31]],"date-time":"2024-08-31T09:52:19Z","timestamp":1725097939000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-77091-4_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030770907","9783030770914"],"references-count":45,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-77091-4_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"22 May 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AIxIA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference of the Italian Association for Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Milan","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 November 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 November 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aiia2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/aixia2020.disco.unimib.it\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"89","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"27","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"30% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}