{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T22:24:18Z","timestamp":1742941458453,"version":"3.40.3"},"publisher-location":"Cham","reference-count":54,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030179526"},{"type":"electronic","value":"9783030179533"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-17953-3_32","type":"book-chapter","created":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T23:25:20Z","timestamp":1556753120000},"page":"427-441","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Breaking Symmetries to Rescue Sum of Squares: The Case of Makespan Scheduling"],"prefix":"10.1007","author":[{"given":"Victor","family":"Verdugo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jos\u00e9","family":"Verschae","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,4,13]]},"reference":[{"key":"32_CR1","unstructured":"Alon, N., Azar, Y., Woeginger, G.J., Yadid, T.: Approximation schemes for scheduling. In: Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018, pp. 493\u2013500, ACM-SIAM (1997)"},{"issue":"1","key":"32_CR2","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1002\/(SICI)1099-1425(199806)1:1<55::AID-JOS2>3.0.CO;2-J","volume":"1","author":"N Alon","year":"1998","unstructured":"Alon, N., Azar, Y., Woeginger, G.J., Yadid, T.: Approximation schemes for scheduling on parallel machines. J. Sched. 1(1), 55\u201366 (1998)","journal-title":"J. Sched."},{"key":"32_CR3","doi-asserted-by":"crossref","unstructured":"Barak, B., Chan, S.O., Kothari, P.K.: Sum of squares lower bounds from pair wise independence. In: Proceedings of the Forty-Seventh Annual ACM Symposium on Theory of Computing, STOC 2015, pp. 97\u2013106. ACM (2015)","DOI":"10.1145\/2746539.2746625"},{"key":"32_CR4","doi-asserted-by":"crossref","unstructured":"Barak, B., Hopkins, S.B., Kelner, J., Kothari, P., Moitra, A., Potechin, A.: A nearly tight sum-of-squares lower bound for the planted clique problem. In: Proceedings of Foundations of Computer Science, FOCS 2016, pp. 428\u2013437. IEEE (2016)","DOI":"10.1109\/FOCS.2016.53"},{"key":"32_CR5","unstructured":"Barak, B., Moitra, A.: Noisy tensor completion via the sum-of-squares hierarchy. In: Proceedings of the 29th Conference on Learning Theory, COLT 2016, pp. 417\u2013445 (2016)"},{"issue":"1\u20132","key":"32_CR6","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/s00209-016-1644-7","volume":"284","author":"G Blekherman","year":"2016","unstructured":"Blekherman, G., Gouveia, J., Pfeiffer, J.: Sums of squares on the hypercube. Mathematische Zeitschrift 284(1\u20132), 41\u201354 (2016)","journal-title":"Mathematische Zeitschrift"},{"key":"32_CR7","doi-asserted-by":"publisher","first-page":"808","DOI":"10.1137\/1.9781611975031.52","volume-title":"Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Friedrich Eisenbrand","year":"2018","unstructured":"Eisenbrand, F., Weismantel, R.: Proximity results and faster algorithms for integer programming using the Steinitz lemma. In: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018, pp. 808\u2013816 (2018)"},{"key":"32_CR8","unstructured":"Garg, S.: Quasi-PTAS for scheduling with precedences using LP hierarchies. In: Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, ICALP 2018, pp. 59:1\u201359:13 (2018)"},{"issue":"1\u20133","key":"32_CR9","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/j.jpaa.2003.12.011","volume":"192","author":"K Gatermann","year":"2004","unstructured":"Gatermann, K., Parrilo, P.A.: Symmetry groups, semidefinite programs, and sums of squares. J. Pure Appl. Algebra 192(1\u20133), 95\u2013128 (2004)","journal-title":"J. Pure Appl. Algebra"},{"key":"32_CR10","doi-asserted-by":"crossref","unstructured":"Goemans, M., Rothvo\u00df, T.: Polynomiality for bin packing with a constant number of item types. In: Proceedings of the Twenty-Fifth annual ACM-SIAM Symposium on Discrete Algorithms, pp. 830\u2013839. SIAM (2014)","DOI":"10.1137\/1.9781611973402.61"},{"key":"32_CR11","doi-asserted-by":"publisher","first-page":"1115","DOI":"10.1145\/227683.227684","volume":"42","author":"M Goemans","year":"1995","unstructured":"Goemans, M., Williamson, D.: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. ACM 42, 1115\u20131145 (1995)","journal-title":"J. ACM"},{"issue":"9","key":"32_CR12","doi-asserted-by":"publisher","first-page":"1563","DOI":"10.1002\/j.1538-7305.1966.tb01709.x","volume":"45","author":"RL Graham","year":"1966","unstructured":"Graham, R.L.: Bounds for certain multiprocessing anomalies. Bell Syst. Tech. J. 45(9), 1563\u20131581 (1966)","journal-title":"Bell Syst. Tech. J."},{"issue":"2","key":"32_CR13","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/s00037-001-8192-0","volume":"10","author":"D Grigoriev","year":"2001","unstructured":"Grigoriev, D.: Complexity of positivstellensatz proofs for the knapsack. Comput. Complex. 10(2), 139\u2013154 (2001)","journal-title":"Comput. Complex."},{"issue":"1\u20132","key":"32_CR14","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1016\/S0304-3975(00)00157-2","volume":"259","author":"D Grigoriev","year":"2001","unstructured":"Grigoriev, D.: Linear lower bound on degrees of positivstellensatz calculus proofs for the parity. Theoret. Comput. Sci. 259(1\u20132), 613\u2013622 (2001)","journal-title":"Theoret. Comput. Sci."},{"key":"32_CR15","volume-title":"Approximation Algorithms for NP-Hard Problems","author":"D Hochbaum","year":"1996","unstructured":"Hochbaum, D.: Approximation Algorithms for NP-Hard Problems. PWS Publishing Co., Boston (1996)"},{"key":"32_CR16","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1145\/7531.7535","volume":"34","author":"D Hochbaum","year":"1987","unstructured":"Hochbaum, D., Shmoys, D.: Using dual approximation algorithms for scheduling problems theoretical and practical results. J. ACM 34, 144\u2013162 (1987)","journal-title":"J. ACM"},{"key":"32_CR17","doi-asserted-by":"crossref","unstructured":"Hopkins, S.B., Kothari, P.K., Potechin, A., Raghavendra, P., Schramm, T., Steurer, D.: The power of sum-of-squares for detecting hidden structures. In: Proceedings of the 58th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2017, pp. 720\u2013731. IEEE (2017)","DOI":"10.1109\/FOCS.2017.72"},{"issue":"1","key":"32_CR18","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1287\/ijoc.1080.0283","volume":"21","author":"R Jans","year":"2009","unstructured":"Jans, R.: Solving lot-sizing problems on parallel identical machines using symmetry-breaking constraints. INFORMS J. Comput. 21(1), 123\u2013136 (2009)","journal-title":"INFORMS J. Comput."},{"issue":"2","key":"32_CR19","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1137\/090749451","volume":"24","author":"K Jansen","year":"2010","unstructured":"Jansen, K.: An EPTAS for scheduling jobs on uniform processors: using an MILP relaxation with a constant number of integral variables. SIAM J. Discrete Math. 24(2), 457\u2013485 (2010)","journal-title":"SIAM J. Discrete Math."},{"key":"32_CR20","unstructured":"Jansen, K., Klein, K., Verschae, J.: Closing the gap for makespan scheduling via sparsification techniques. In: Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016, pp. 72:1\u201372:13 (2016)"},{"key":"32_CR21","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1016\/j.disopt.2011.07.001","volume":"8","author":"V Kaibel","year":"2011","unstructured":"Kaibel, V., Peinhardt, M., Pfetsch, M.E.: Orbitopal fixing. Discrete Optim. 8, 595\u2013610 (2011)","journal-title":"Discrete Optim."},{"issue":"1","key":"32_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10107-006-0081-5","volume":"114","author":"V Kaibel","year":"2008","unstructured":"Kaibel, V., Pfetsch, M.: Packing and partitioning orbitopes. Math. Program. 114(1), 1\u201336 (2008)","journal-title":"Math. Program."},{"key":"32_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/978-3-642-20807-2_24","volume-title":"Integer Programming and Combinatoral Optimization","author":"AR Karlin","year":"2011","unstructured":"Karlin, A.R., Mathieu, C., Nguyen, C.T.: Integrality gaps of linear and semi-definite programming relaxations for knapsack. In: G\u00fcnl\u00fck, O., Woeginger, G.J. (eds.) IPCO 2011. LNCS, vol. 6655, pp. 301\u2013314. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-20807-2_24"},{"key":"32_CR24","unstructured":"Kothari, P., O\u2019Donnell, R., Schramm, T.: SOS lower bounds with hard constraints: think global, act local. arXiv preprint arXiv:1809.01207 (2018)"},{"key":"32_CR25","doi-asserted-by":"crossref","unstructured":"Kothari, P.K., Mori, R., O\u2019Donnell, R., Witmer, D.: Sum of squares lower bounds for refuting any CSP. In: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017, pp. 132\u2013145. ACM (2017)","DOI":"10.1145\/3055399.3055485"},{"key":"32_CR26","doi-asserted-by":"crossref","unstructured":"Kothari, P.K., Steinhardt, J., Steurer, D.: Robust moment estimation and improved clustering via sum of squares. In: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2018, pp. 1035\u20131046. ACM (2018)","DOI":"10.1145\/3188745.3188970"},{"issue":"1","key":"32_CR27","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1287\/moor.2016.0797","volume":"42","author":"A Kurpisz","year":"2016","unstructured":"Kurpisz, A., Lepp\u00e4nen, S., Mastrolilli, M.: On the hardest problem formulations for the 0\/1 Lasserre hierarchy. Math. Oper. Res. 42(1), 135\u2013143 (2016)","journal-title":"Math. Oper. Res."},{"key":"32_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1007\/978-3-319-33461-5_30","volume-title":"Integer Programming and Combinatorial Optimization","author":"A Kurpisz","year":"2016","unstructured":"Kurpisz, A., Lepp\u00e4nen, S., Mastrolilli, M.: Sum-of-squares hierarchy lower bounds for symmetric formulations. In: Louveaux, Q., Skutella, M. (eds.) IPCO 2016. LNCS, vol. 9682, pp. 362\u2013374. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-33461-5_30"},{"issue":"1\u20132","key":"32_CR29","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10107-016-1102-7","volume":"166","author":"A Kurpisz","year":"2017","unstructured":"Kurpisz, A., Lepp\u00e4nen, S., Mastrolilli, M.: An unbounded sum-of-squares hierarchy integrality gap for a polynomially solvable problem. Math. Program. 166(1\u20132), 1\u201317 (2017)","journal-title":"Math. Program."},{"issue":"1\u20132","key":"32_CR30","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/s10107-017-1152-5","volume":"172","author":"A Kurpisz","year":"2018","unstructured":"Kurpisz, A., Mastrolilli, M., Mathieu, C., M\u00f6mke, T., Verdugo, V., Wiese, A.: Semidefinite and linear programming integrality gaps for scheduling identical machines. Math. Program. 172(1\u20132), 231\u2013248 (2018)","journal-title":"Math. Program."},{"issue":"4","key":"32_CR31","doi-asserted-by":"publisher","first-page":"871","DOI":"10.1287\/moor.28.4.871.20508","volume":"28","author":"M Laurent","year":"2003","unstructured":"Laurent, M.: Lower bound for the number of iterations in semidefinite hierarchies for the cut polytope. Math. Oper. Res. 28(4), 871\u2013883 (2003)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"32_CR32","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10107-004-0561-4","volume":"109","author":"M Laurent","year":"2007","unstructured":"Laurent, M.: Semidefinite representations for finite varieties. Math. Program. 109(1), 1\u201326 (2007)","journal-title":"Math. Program."},{"key":"32_CR33","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/978-0-387-09686-5_7","volume-title":"Emerging Applications of Algebraic Geometry","author":"M Laurent","year":"2009","unstructured":"Laurent, M.: Sums of squares, moment matrices and optimization over polynomials. In: Putinar, M., Sullivant, S. (eds.) Emerging Applications of Algebraic Geometry, vol. 149, pp. 157\u2013270. Springer, New York (2009). https:\/\/doi.org\/10.1007\/978-0-387-09686-5_7"},{"key":"32_CR34","doi-asserted-by":"crossref","unstructured":"Levey, E., Rothvoss, T.: A (1+epsilon)-approximation for makespan scheduling with precedence constraints using LP hierarchies. In:Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2016, pp. 168\u2013177. ACM (2016)","DOI":"10.1145\/2897518.2897532"},{"key":"32_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1007\/978-3-540-85097-7_31","volume-title":"Combinatorial Optimization and Applications","author":"L Liberti","year":"2008","unstructured":"Liberti, L.: Automatic generation of symmetry-breaking constraints. In: Yang, B., Du, D.-Z., Wang, C.A. (eds.) COCOA 2008. LNCS, vol. 5165, pp. 328\u2013338. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85097-7_31"},{"key":"32_CR36","series-title":"The IMA Volumes in Mathematics and its Applications","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/978-1-4614-1927-3_9","volume-title":"Mixed Integer Nonlinear Programming","author":"L Liberti","year":"2012","unstructured":"Liberti, L.: Symmetry in mathematical programming. In: Lee, J., Leyffer, S. (eds.) Mixed Integer Nonlinear Programming. The IMA Volumes in Mathematics and its Applications, pp. 263\u2013283. Springer, New York (2012). https:\/\/doi.org\/10.1007\/978-1-4614-1927-3_9"},{"key":"32_CR37","doi-asserted-by":"crossref","unstructured":"Ma, T., Shi, J., Steurer, D.: Polynomial-time tensor decompositions with sum-of squares. In: Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2016, pp. 438\u2013446. IEEE (2016)","DOI":"10.1109\/FOCS.2016.54"},{"key":"32_CR38","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/s10107-002-0358-2","volume":"94","author":"F Margot","year":"2002","unstructured":"Margot, F.: Pruning by isomorphism in branch-and-cut. Math. Program. 94, 71\u201390 (2002)","journal-title":"Math. Program."},{"key":"32_CR39","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1007\/978-3-540-68279-0_17","volume-title":"50 Years of Integer Programming 1958\u20132008","author":"F Margot","year":"2010","unstructured":"Margot, F.: Symmetry in integer linear programming. In: J\u00fcnger, M., et al. (eds.) 50 Years of Integer Programming 1958\u20132008, pp. 647\u2013686. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-540-68279-0_17"},{"key":"32_CR40","unstructured":"O\u2019Donnell, R.: SOS is not obviously automatizable, even approximately. In: Proceedings of the 8th Innovations in Theoretical Computer Science Conference (ITCS 2017). Leibniz International Proceedings in Informatics (LIPIcs), vol. 67, pp. 59:1\u201359:10. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2017)"},{"key":"32_CR41","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/s12532-014-0072-0","volume":"6","author":"J Ostrowski","year":"2014","unstructured":"Ostrowski, J.: Using symmetry to optimize over the Sherali-Adams relaxation. Math. Program. Comput. 6, 405\u2013428 (2014)","journal-title":"Math. Program. Comput."},{"key":"32_CR42","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/s10107-009-0273-x","volume":"126","author":"J Ostrowski","year":"2011","unstructured":"Ostrowski, J., Linderoth, J., Rossi, F., Smriglio, S.: Orbital branching. Math. Program. 126, 147\u2013178 (2011)","journal-title":"Math. Program."},{"key":"32_CR43","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/s10107-003-0387-5","volume":"96","author":"P Parrilo","year":"2003","unstructured":"Parrilo, P.: Semidefinite programming relaxations for semialgebraic problems. Math. program. 96, 293\u2013320 (2003)","journal-title":"Math. program."},{"key":"32_CR44","unstructured":"Potechin, A.: Sum of squares lower bounds from symmetry and a good story. arXiv preprint arXiv:1711.11469 (2017)"},{"key":"32_CR45","unstructured":"Potechin, A., Steurer, D.: Exact tensor completion with sum-of-squares. arXiv preprint arXiv:1702.06237 (2017)"},{"key":"32_CR46","unstructured":"Raghavendra, P., Schramm, T., Steurer, D.: High-dimensional estimation via sum-of-squares proofs. arXiv preprint arXiv:1807.11419 (2018)"},{"issue":"2","key":"32_CR47","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/s10107-017-1127-6","volume":"167","author":"A Raymond","year":"2018","unstructured":"Raymond, A., Saunderson, J., Singh, M., Thomas, R.R.: Symmetric sums of squares over k-subset hypercubes. Math. Program. 167(2), 315\u2013354 (2018)","journal-title":"Math. Program."},{"issue":"4","key":"32_CR48","doi-asserted-by":"publisher","first-page":"1239","DOI":"10.2178\/jsl\/1203350785","volume":"72","author":"AA Razborov","year":"2007","unstructured":"Razborov, A.A.: Flag algebras. J. Symbol. Logic 72(4), 1239\u20131282 (2007)","journal-title":"J. Symbol. Logic"},{"issue":"3","key":"32_CR49","doi-asserted-by":"publisher","first-page":"946","DOI":"10.1137\/090747476","volume":"24","author":"AA Razborov","year":"2010","unstructured":"Razborov, A.A.: On 3-hypergraphs with forbidden 4-vertex configurations. SIAM J. Discrete Math. 24(3), 946\u2013963 (2010)","journal-title":"SIAM J. Discrete Math."},{"key":"32_CR50","unstructured":"Rothvo\u00df, T.: The Lasserre hierarchy in approximation algorithms. Lecture notes for MAPSP (2013)"},{"key":"32_CR51","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-6804-6","volume-title":"The Symmetric Group: Representations, Combinatorial Algorithms, and Symmetric Functions","author":"BE Sagan","year":"2001","unstructured":"Sagan, B.E.: The Symmetric Group: Representations, Combinatorial Algorithms, and Symmetric Functions. GTM, vol. 203. Springer, New York (2001). https:\/\/doi.org\/10.1007\/978-1-4757-6804-6"},{"key":"32_CR52","doi-asserted-by":"crossref","unstructured":"Schoenebeck, G.: Linear level Lasserre lower bounds for certain k-CSPs. In: Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2008, pp. 593\u2013602. IEEE (2008)","DOI":"10.1109\/FOCS.2008.74"},{"issue":"5","key":"32_CR53","doi-asserted-by":"publisher","first-page":"1318","DOI":"10.1137\/110851201","volume":"41","author":"O Svensson","year":"2012","unstructured":"Svensson, O.: Santa claus schedules jobs on unrelated machines. SIAM J. Comput. 41(5), 1318\u20131341 (2012)","journal-title":"SIAM J. Comput."},{"key":"32_CR54","doi-asserted-by":"crossref","unstructured":"Verdugo, V., Verschae, J.: Breaking symmetries to rescue sum of squares: the case of makespan scheduling. arXiv preprint arXiv:abs\/1811.08539 (2018)","DOI":"10.1007\/978-3-030-17953-3_32"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-17953-3_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T12:44:09Z","timestamp":1709815449000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-17953-3_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030179526","9783030179533"],"references-count":54,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-17953-3_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"13 April 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IPCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Integer Programming and Combinatorial Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ann Arbor, MI","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 May 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 May 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ipco2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/umich.edu\/~ipco2019conf\/","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":"113","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":"33","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":"0","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":"29% - 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":"2.5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}