{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,4]],"date-time":"2025-09-04T14:03:17Z","timestamp":1756994597341,"version":"3.41.0"},"reference-count":24,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2019,1,28]],"date-time":"2019-01-28T00:00:00Z","timestamp":1548633600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["IIS-1421322 and IIS-1420941"],"award-info":[{"award-number":["IIS-1421322 and IIS-1420941"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Commun. ACM"],"published-print":{"date-parts":[[2019,1,28]]},"abstract":"<jats:p>\n            Constrained optimization problems are at the heart of significant applications in a broad range of domains, including finance, transportation, manufacturing, and healthcare. Modeling and solving these problems has relied on application-specific solutions, which are often complex, error-prone, and do not generalize. Our goal is to create a domain-independent, declarative approach, supported and powered by the system where the data relevant to these problems typically resides: the database. We present a complete system that supports\n            <jats:italic>package queries<\/jats:italic>\n            , a new query model that extends traditional database queries to handle complex constraints and preferences over answer sets, allowing the declarative specification and efficient evaluation of a significant class of constrained optimization problems---integer linear programs (ILP)---within a database.\n          <\/jats:p>","DOI":"10.1145\/3299881","type":"journal-article","created":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T13:16:22Z","timestamp":1548767782000},"page":"108-116","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Scalable computation of high-order optimization queries"],"prefix":"10.1145","volume":"62","author":[{"given":"Matteo","family":"Brucato","sequence":"first","affiliation":[{"name":"University of Massachusetts, Amherst, MA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Azza","family":"Abouzied","sequence":"additional","affiliation":[{"name":"New York University, Abu Dhabi, UAE"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexandra","family":"Meliou","sequence":"additional","affiliation":[{"name":"University of Massachusetts, Amherst, MA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,1,28]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-09770-1_1"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1080\/01969720601139041"},{"journal-title":"J. AIMMS Optimization Modeling. Paragon Decision Technology","year":"2006","author":"Bisschop","key":"e_1_2_1_3_1"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-017-0483-4"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.14778\/2904483.2904489"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.14778\/2733004.2733038"},{"volume-title":"Applied Integer Programming: Modeling and Solution","year":"2011","author":"Chen D.-S.","key":"e_1_2_1_7_1"},{"key":"e_1_2_1_8_1","first-page":"75","article-title":"On the complexity of branch and cut methods for the traveling salesman problem","volume":"1","author":"Cook W.","year":"1990","journal-title":"Polyhedral Comb."},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1810617.1810626"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213556.2213592"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00288933"},{"key":"e_1_2_1_12_1","unstructured":"IBM CPLEX Optimization Studio. http:\/\/www.ibm.com\/software\/commerce\/optimization\/cplex-optimizer\/.  IBM CPLEX Optimization Studio. http:\/\/www.ibm.com\/software\/commerce\/optimization\/cplex-optimizer\/."},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557074"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1287\/inte.22.1.90"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213875"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1137\/1033004"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2037661.2037665"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2559206.2574794"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.31.2.159"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1118\/1.598750"},{"key":"e_1_2_1_21_1","first-page":"3","article-title":"A feasible application of constrained optimization in the IMRT system","volume":"54","author":"Terrer J.M.A.","year":"2007","journal-title":"IEEE Trans. Biomed. Eng."},{"key":"e_1_2_1_22_1","unstructured":"The Sloan Digital Sky Survey. http:\/\/www.sdss.org\/.  The Sloan Digital Sky Survey. http:\/\/www.sdss.org\/."},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2750549"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.5555\/1971947"}],"container-title":["Communications of the ACM"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3299881","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3299881","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3299881","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:53:38Z","timestamp":1750204418000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3299881"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,1,28]]},"references-count":24,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2019,1,28]]}},"alternative-id":["10.1145\/3299881"],"URL":"https:\/\/doi.org\/10.1145\/3299881","relation":{},"ISSN":["0001-0782","1557-7317"],"issn-type":[{"type":"print","value":"0001-0782"},{"type":"electronic","value":"1557-7317"}],"subject":[],"published":{"date-parts":[[2019,1,28]]},"assertion":[{"value":"2019-01-28","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}