{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,28]],"date-time":"2025-04-28T14:08:30Z","timestamp":1745849310660},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319597751"},{"type":"electronic","value":"9783319597768"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-59776-8_19","type":"book-chapter","created":{"date-parts":[[2017,5,30]],"date-time":"2017-05-30T09:26:33Z","timestamp":1496136393000},"page":"229-243","source":"Crossref","is-referenced-by-count":5,"title":["Experimental Validation of Volume-Based Comparison for Double-McCormick Relaxations"],"prefix":"10.1007","author":[{"given":"Emily","family":"Speakman","sequence":"first","affiliation":[]},{"given":"Han","family":"Yu","sequence":"additional","affiliation":[]},{"given":"Jon","family":"Lee","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,5,31]]},"reference":[{"issue":"9","key":"19_CR1","doi-asserted-by":"crossref","first-page":"1137","DOI":"10.1016\/S0098-1354(98)00027-1","volume":"22","author":"C Adjiman","year":"1998","unstructured":"Adjiman, C., Dallwig, S., Floudas, C., Neumaier, A.: A global optimization method, $$\\alpha $$ BB, for general twice-differentiable constrained NLPs: I. Theoretical advances. Comput. Chem. Eng. 22(9), 1137\u20131158 (1998)","journal-title":"Comput. Chem. Eng."},{"issue":"4","key":"19_CR2","doi-asserted-by":"crossref","first-page":"841","DOI":"10.1007\/s00454-009-9232-9","volume":"43","author":"F Ardila","year":"2010","unstructured":"Ardila, F., Benedetti, C., Doker, J.: Matroid polytopes and their volumes. Discrete Comput. Geom. 43(4), 841\u2013854 (2010)","journal-title":"Discrete Comput. Geom."},{"issue":"4\u20135","key":"19_CR3","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1080\/10556780903087124","volume":"24","author":"P Belotti","year":"2009","unstructured":"Belotti, P., Lee, J., Liberti, L., Margot, F., W\u00e4chter, A.: Branching and bounds tightening techniques for non-convex MINLP. Optim. Methods Softw. 24(4\u20135), 597\u2013634 (2009)","journal-title":"Optim. Methods Softw."},{"key":"19_CR4","doi-asserted-by":"crossref","unstructured":"Brightwell, G., Winkler, P.: Counting linear extensions is #P-complete. In: Proceedings of the Twenty-third Annual ACM Symposium on Theory of Computing, STOC 1991, pp. 175\u2013181. ACM, New York (1991)","DOI":"10.1145\/103418.103441"},{"key":"19_CR5","doi-asserted-by":"crossref","unstructured":"Burggraf, K., De Loera, J., Omar, M.: On volumes of permutation polytopes. In: Bezdek, K., Deza, A., Ye, Y. (eds.) Discrete Geometry and Optimization, vol. 69, pp. 55\u201377. Springer, Heidelberg (2013)","DOI":"10.1007\/978-3-319-00200-2_5"},{"key":"19_CR6","doi-asserted-by":"crossref","first-page":"661","DOI":"10.1007\/s10898-009-9484-1","volume":"47","author":"S Cafieri","year":"2010","unstructured":"Cafieri, S., Lee, J., Liberti, L.: On convex relaxations of quadrilinear terms. J. Global Optim. 47, 661\u2013685 (2010)","journal-title":"J. Global Optim."},{"issue":"1","key":"19_CR7","first-page":"329","volume":"154","author":"SS Dey","year":"2015","unstructured":"Dey, S.S., Molinaro, M., Wang, Q.: Approximating polyhedra with sparse inequalities. Math. Program. 154(1), 329\u2013352 (2015)","journal-title":"Math. Program."},{"issue":"2","key":"19_CR8","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"DE Dolan","year":"2002","unstructured":"Dolan, D.E., Mor\u00e9, J.J.: Benchmarking optimization software with performance profiles. Math. Program. 91(2), 201\u2013213 (2002)","journal-title":"Math. Program."},{"issue":"1","key":"19_CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/102782.102783","volume":"38","author":"M Dyer","year":"1991","unstructured":"Dyer, M., Frieze, A., Kannan, R.: A random polynomial-time algorithm for approximating the volume of convex bodies. J. ACM 38(1), 1\u201317 (1991)","journal-title":"J. ACM"},{"issue":"1\u20133","key":"19_CR10","first-page":"293","volume":"163","author":"CW Ko","year":"1997","unstructured":"Ko, C.W., Lee, J., Steingr\u00edmsson, E.: The volume of relaxed Boolean-quadric and cut polytopes. Discrete Math. 163(1\u20133), 293\u2013298 (1997)","journal-title":"Discrete Math."},{"issue":"3\/4","key":"19_CR11","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1147\/rd.513.0489","volume":"51","author":"J Lee","year":"2007","unstructured":"Lee, J.: Mixed integer nonlinear programming: some modeling and solution issues. IBM J. Res. Dev. 51(3\/4), 489\u2013497 (2007)","journal-title":"IBM J. Res. Dev."},{"key":"19_CR12","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/0166-218X(94)90006-X","volume":"55","author":"J Lee","year":"1994","unstructured":"Lee, J., Morris, W.: Geometric comparison of combinatorial polytopes. Discrete Appl. Math. 55, 163\u2013182 (1994)","journal-title":"Discrete Appl. Math."},{"key":"19_CR13","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/BF01580665","volume":"10","author":"G McCormick","year":"1976","unstructured":"McCormick, G.: Computability of global solutions to factorable nonconvex programs: Part I. Convex underestimating problems. Math. Program. 10, 147\u2013175 (1976)","journal-title":"Math. Program."},{"key":"19_CR14","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1023\/B:JOGO.0000042112.72379.e6","volume":"29","author":"C Meyer","year":"2004","unstructured":"Meyer, C., Floudas, C.: Trilinear monomials with mixed sign domains: facets of the convex and concave envelopes. J. Global Optim. 29, 125\u2013155 (2004)","journal-title":"J. Global Optim."},{"key":"19_CR15","doi-asserted-by":"crossref","unstructured":"Meyer, C., Floudas, C.: Trilinear monomials with positive or negative domains: facets of the convex and concave envelopes. In: Floudas C.A., Pardalos P. (eds) Frontiers in Global Optimization. NOIA, vol. 74, pp. 327\u2013352. Springer, Boston (2004)","DOI":"10.1007\/978-1-4613-0251-3_18"},{"issue":"2","key":"19_CR16","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1007\/s10898-014-0166-2","volume":"59","author":"R Misener","year":"2014","unstructured":"Misener, R., Floudas, C.A.: ANTIGONE: Algorithms for coNTinuous\/Integer Global Optimization of Nonlinear Equations. J. Global Optim. 59(2), 503\u2013526 (2014). doi: 10.1007\/s10898-014-0166-2","journal-title":"J. Global Optim."},{"key":"19_CR17","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1023\/A:1008217604285","volume":"10","author":"A Rikun","year":"1997","unstructured":"Rikun, A.: A convex envelope formula for multilinear functions. J. Global Optim. 10, 425\u2013437 (1997)","journal-title":"J. Global Optim."},{"issue":"2","key":"19_CR18","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/BF00138689","volume":"8","author":"H Ryoo","year":"1996","unstructured":"Ryoo, H., Sahinidis, N.: A branch-and-reduce approach to global optimization. J. Global Optim. 8(2), 107\u2013138 (1996)","journal-title":"J. Global Optim."},{"key":"19_CR19","unstructured":"Sahinidis, N.: BARON 15.6.5: Global Optimization of Mixed-Integer Nonlinear Programs, User\u2019s Manual (2015)"},{"key":"19_CR20","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1016\/S0098-1354(98)00286-5","volume":"23","author":"E Smith","year":"1999","unstructured":"Smith, E., Pantelides, C.: A symbolic reformulation\/spatial branch-and-bound algorithm for the global optimisation of nonconvex MINLPs. Comput. Chem. Eng. 23, 457\u2013478 (1999)","journal-title":"Comput. Chem. Eng."},{"key":"19_CR21","unstructured":"Sofi, A., Mamat, M., Mohid, S., Ibrahim, M., Khalid, N.: Performance profile comparison using matlab. In: Proceedings of International Conference on Information Technology & Society 2015 (2015)"},{"key":"19_CR22","unstructured":"Speakman, E., Lee, J.: On sBB branching for trilinear monomials. In: Rocha, A., Costa, M., Fernandes, E. (eds.) GOW 2016, pp. 81\u201384 (2016). ISBN: 978-989-20-6764-3"},{"key":"19_CR23","doi-asserted-by":"crossref","unstructured":"Speakman, E., Lee, J.: Quantifying double McCormick. To appear in: Math. Oper. Res. (2017)","DOI":"10.1287\/moor.2017.0846"},{"issue":"1","key":"19_CR24","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1007\/BF02187680","volume":"1","author":"R Stanley","year":"1986","unstructured":"Stanley, R.: Two poset polytopes. Discrete Comput. Geom. 1(1), 9\u201323 (1986)","journal-title":"Discrete Comput. Geom."},{"issue":"4","key":"19_CR25","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1007\/BF02574393","volume":"12","author":"E Steingr\u00edmsson","year":"1994","unstructured":"Steingr\u00edmsson, E.: A decomposition of 2-weak vertex-packing polytopes. Discrete Comput. Geom. 12(4), 465\u2013479 (1994)","journal-title":"Discrete Comput. Geom."},{"key":"19_CR26","unstructured":"Vigerske, S., Gleixner, A.: Scip: Global optimization of mixed-integer nonlinear programs in a branch-and-cut framework. Technical report 16-24, ZIB, Takustr. 7, 14195, Berlin (2016)"}],"container-title":["Lecture Notes in Computer Science","Integration of AI and OR Techniques in Constraint Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-59776-8_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,25]],"date-time":"2019-09-25T03:41:27Z","timestamp":1569382887000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-59776-8_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319597751","9783319597768"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-59776-8_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}