{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T23:02:41Z","timestamp":1772838161193,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":32,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,1,12]],"date-time":"2014-01-12T00:00:00Z","timestamp":1389484800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2014,1,12]]},"DOI":"10.1145\/2554797.2554838","type":"proceedings-article","created":{"date-parts":[[2014,1,14]],"date-time":"2014-01-14T13:40:06Z","timestamp":1389706806000},"page":"449-458","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Integer feasibility of random polytopes"],"prefix":"10.1145","author":[{"given":"Karthekeyan","family":"Chandrasekaran","sequence":"first","affiliation":[{"name":"Harvard, Cambridge, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Santosh S.","family":"Vempala","sequence":"additional","affiliation":[{"name":"Georgia Tech, Atlanta, GA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2014,1,12]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/780542.780578"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511814068"},{"key":"e_1_3_2_1_3_1","first-page":"322","volume-title":"Proceedings of the 4th annual ACM-SIAM symposium on discrete algorithms, SODA '93","author":"Broder A.","year":"1993","unstructured":"A. Broder , A. Frieze , and E. Upfal . On the satisfiability and maximum satisfiability of random 3-cnf formulas . In Proceedings of the 4th annual ACM-SIAM symposium on discrete algorithms, SODA '93 , pages 322 -- 330 , 1993 . A. Broder, A. Frieze, and E. Upfal. On the satisfiability and maximum satisfiability of random 3-cnf formulas. In Proceedings of the 4th annual ACM-SIAM symposium on discrete algorithms, SODA '93, pages 322--330, 1993."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1137\/0215080"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0255(90)90030-E"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/2133036.2133160"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.4.3.235"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1992.267789"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2011.31"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.2307\/1905292"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0894-0347-99-00305-7"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/0218037"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.disopt.2012.11.003"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.12.3.415"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0195-6698(86)80041-5"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2012.23"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13036-6_21"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-008-0247-4"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1006\/eujc.1997.0162"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0894-0347-96-00175-0"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.13.6.930"},{"key":"e_1_3_2_1_23_1","volume-title":"Integer and Combinatorial Optimization","author":"Nemhauser G.","year":"1999","unstructured":"G. Nemhauser and L. Wolsey . Integer and Combinatorial Optimization . Wiley-Interscience , 1999 . G. Nemhauser and L. Wolsey. Integer and Combinatorial Optimization. Wiley-Interscience, 1999."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488652"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.5555\/1873601.1873701"},{"key":"e_1_3_2_1_26_1","first-page":"113","volume-title":"Proceedings of the Princeton symposium on mathematical programming","author":"Pr\u00e9kopa A.","year":"1970","unstructured":"A. Pr\u00e9kopa . On probabilistic constrained programming . In Proceedings of the Princeton symposium on mathematical programming , pages 113 -- 138 . Princeton University Press Princeton, NJ , 1970 . A. Pr\u00e9kopa. On probabilistic constrained programming. In Proceedings of the Princeton symposium on mathematical programming, pages 113--138. Princeton University Press Princeton, NJ, 1970."},{"key":"e_1_3_2_1_27_1","volume-title":"Probabilistic programming. Handbooks in operations research and management science, 10:267--351","author":"Pr\u00e9kopa A.","year":"2003","unstructured":"A. Pr\u00e9kopa . Probabilistic programming. Handbooks in operations research and management science, 10:267--351 , 2003 . A. Pr\u00e9kopa. Probabilistic programming. Handbooks in operations research and management science, 10:267--351, 2003."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-002-0337-7"},{"key":"e_1_3_2_1_29_1","volume-title":"Theory of Linear and Integer Programming","author":"Schrijver A.","year":"1998","unstructured":"A. Schrijver . Theory of Linear and Integer Programming . John Wiley & sons, 1998 . A. Schrijver. Theory of Linear and Integer Programming. John Wiley & sons, 1998."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9947-1985-0784009-0"},{"key":"e_1_3_2_1_31_1","volume-title":"Ten lectures on the probabilistic method. SBMS-NSF","author":"Spencer J.","year":"1987","unstructured":"J. Spencer . Ten lectures on the probabilistic method. SBMS-NSF , SIAM , 1987 . J. Spencer. Ten lectures on the probabilistic method. SBMS-NSF, SIAM, 1987."},{"key":"e_1_3_2_1_32_1","first-page":"2938","volume-title":"Proceedings of the 23rd international joint conference on Artificial Intelligence","author":"Yanagisawa H.","year":"2013","unstructured":"H. Yanagisawa and T. Osogami . Improved integer programming approaches for chance-constrained stochastic programming . In Proceedings of the 23rd international joint conference on Artificial Intelligence , pages 2938 -- 2944 , 2013 . H. Yanagisawa and T. Osogami. Improved integer programming approaches for chance-constrained stochastic programming. In Proceedings of the 23rd international joint conference on Artificial Intelligence, pages 2938--2944, 2013."}],"event":{"name":"ITCS'14: Innovations in Theoretical Computer Science","location":"Princeton New Jersey USA","acronym":"ITCS'14","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 5th conference on Innovations in theoretical computer science"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2554797.2554838","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2554797.2554838","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:34:22Z","timestamp":1750232062000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2554797.2554838"}},"subtitle":["random integer programs"],"short-title":[],"issued":{"date-parts":[[2014,1,12]]},"references-count":32,"alternative-id":["10.1145\/2554797.2554838","10.1145\/2554797"],"URL":"https:\/\/doi.org\/10.1145\/2554797.2554838","relation":{},"subject":[],"published":{"date-parts":[[2014,1,12]]},"assertion":[{"value":"2014-01-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}