{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:23:22Z","timestamp":1750307002540,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":19,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,6,4]],"date-time":"2012-06-04T00:00:00Z","timestamp":1338768000000},"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":[[2012,6,4]]},"DOI":"10.1145\/2229012.2229067","type":"proceedings-article","created":{"date-parts":[[2012,6,5]],"date-time":"2012-06-05T17:35:37Z","timestamp":1338917737000},"page":"705-722","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Monotone branch-and-bound search for restricted combinatorial auctions"],"prefix":"10.1145","author":[{"given":"John","family":"Lai","sequence":"first","affiliation":[{"name":"Harvard University, Cambridge, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Parkes","sequence":"additional","affiliation":[{"name":"Harvard University, Cambridge, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2012,6,4]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/518904.878881"},{"key":"e_1_3_2_1_2_1","volume-title":"Introduction to Linear Optimization","author":"BERTSIMAS D.","unstructured":"BERTSIMAS , D. AND TSITSIKLIS , J. 1997. Introduction to Linear Optimization 1 st Ed. Athena Scientific . BERTSIMAS, D. AND TSITSIKLIS, J. 1997. Introduction to Linear Optimization 1st Ed. Athena Scientific.","edition":"1"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1566374.1566387"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","unstructured":"FEAUTRIER P. 1988. Parametric integer programming. RAIRO Recherche Op'erationnelle 22.  FEAUTRIER P. 1988. Parametric integer programming. RAIRO Recherche Op'erationnelle 22.","DOI":"10.1051\/ro\/1988220302431"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/2133036.2133094"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806732"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13520-0_23"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2005.76"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/585265.585266"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/352871.352879"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-5060(08)70745-3"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.geb.2007.12.009"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"crossref","unstructured":"MYERSON R. 1981. Optimal auction design. Mathematics of Operations Research 58--73.  MYERSON R. 1981. Optimal auction design. Mathematics of Operations Research 58--73.","DOI":"10.1287\/moor.6.1.58"},{"volume-title":"Integer and Combinatorial Optimization","author":"NEMHAUSER G.","key":"e_1_3_2_1_14_1","unstructured":"NEMHAUSER , G. AND WOLSEY , L. 1998. Integer and Combinatorial Optimization . J. Wiley and Sons, Inc. NEMHAUSER, G. AND WOLSEY, L. 1998. Integer and Combinatorial Optimization. J. Wiley and Sons, Inc."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-95891-8_9"},{"key":"e_1_3_2_1_16_1","volume-title":"Proc. of 22nd AAAI Conference. 94--101","author":"PARKES D. C.","year":"2007","unstructured":"PARKES , D. C. AND DUONG , Q. 2007 . An ironing-based approach to adaptive online mechanism design in single-valued domains . In Proc. of 22nd AAAI Conference. 94--101 . PARKES, D. C. AND DUONG, Q. 2007. An ironing-based approach to adaptive online mechanism design in single-valued domains. In Proc. of 22nd AAAI Conference. 94--101."},{"key":"e_1_3_2_1_17_1","volume-title":"Proc. of 19th AAAI Conference. 34--41","author":"PARKES D. C.","year":"2004","unstructured":"PARKES , D. C. AND SCHOENEBECK , G. 2004 . Growrange: Anytime vcg-based mechanisms . In Proc. of 19th AAAI Conference. 34--41 . PARKES, D. C. AND SCHOENEBECK, G. 2004. Growrange: Anytime vcg-based mechanisms. In Proc. of 19th AAAI Conference. 34--41."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(01)00159-X"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.1040.0336"}],"event":{"name":"EC '12: ACM Conference on Electronic Commerce","sponsor":["SIGecom Special Interest Group on Economics and Computation"],"location":"Valencia Spain","acronym":"EC '12"},"container-title":["Proceedings of the 13th ACM Conference on Electronic Commerce"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2229012.2229067","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2229012.2229067","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:48:51Z","timestamp":1750236531000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2229012.2229067"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,6,4]]},"references-count":19,"alternative-id":["10.1145\/2229012.2229067","10.1145\/2229012"],"URL":"https:\/\/doi.org\/10.1145\/2229012.2229067","relation":{},"subject":[],"published":{"date-parts":[[2012,6,4]]},"assertion":[{"value":"2012-06-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}