{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T15:15:49Z","timestamp":1648912549529},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2015,4,3]],"date-time":"2015-04-03T00:00:00Z","timestamp":1428019200000},"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":["J Glob Optim"],"published-print":{"date-parts":[[2016,10]]},"DOI":"10.1007\/s10898-015-0297-0","type":"journal-article","created":{"date-parts":[[2015,4,3]],"date-time":"2015-04-03T09:36:40Z","timestamp":1428053800000},"page":"173-193","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Surrogate-RLT cuts for zero\u2013one integer programs"],"prefix":"10.1007","volume":"66","author":[{"given":"Junsang","family":"Yuh","sequence":"first","affiliation":[]},{"given":"Youngho","family":"Lee","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,4,3]]},"reference":[{"key":"297_CR1","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/s11590-014-0763-5","volume":"9","author":"WP Adams","year":"2015","unstructured":"Adams, W.P., Sherali, H.D.: RLT insights into lift-and-project closures. Optim. Lett. 9, 19\u201339 (2015)","journal-title":"Optim. Lett."},{"key":"297_CR2","doi-asserted-by":"crossref","first-page":"1229","DOI":"10.1287\/mnsc.42.9.1229","volume":"42","author":"E Balas","year":"1996","unstructured":"Balas, E., Ceria, S., Cornuej\u00f3ls, G.: Mixed 0\u20131 programming by lift-and-project in a branch-and-cut framework. Manag. Sci. 42, 1229\u20131246 (1996)","journal-title":"Manag. Sci."},{"key":"297_CR3","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/s10107-006-0049-5","volume":"113","author":"E Balas","year":"2008","unstructured":"Balas, E., Saxena, A.: Optimizing over the split closure. Math. Program. A 113, 219\u2013240 (2008)","journal-title":"Math. Program. A"},{"key":"297_CR4","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/s12532-012-0037-0","volume":"4","author":"P Bonami","year":"2012","unstructured":"Bonami, P.: On optimizing over lift-and-project closures. Math. Program. Comput. 4, 151\u2013179 (2012)","journal-title":"Math. Program. Comput."},{"key":"297_CR5","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/s10107-006-0051-y","volume":"113","author":"P Bonami","year":"2008","unstructured":"Bonami, P., Cornuej\u00f3ls, G., Dash, S., Fischetti, M., Lodi, A.: Projected Chv\u00e1tal\u2013Gomory cuts for mixed integer linear programs. Math. Program. A 113, 241\u2013257 (2008)","journal-title":"Math. Program. A"},{"key":"297_CR6","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1016\/j.disopt.2005.08.006","volume":"2","author":"P Bonami","year":"2005","unstructured":"Bonami, P., Minoux, M.: Using rank-1 lift-and-project closures to generate cuts for 0\u20131 MIPs, a computational investigation. Discrete Optim. 2, 288\u2013307 (2005)","journal-title":"Discrete Optim."},{"key":"297_CR7","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/s10107-010-0365-7","volume":"124","author":"M Fischetti","year":"2010","unstructured":"Fischetti, M., Salvagnin, D., Zanette, A.: A note on the selection of Benders\u2019 cuts. Math. Program. B 124, 175\u2013182 (2010)","journal-title":"Math. Program. B"},{"key":"297_CR8","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/S0167-6377(03)00014-2","volume":"31","author":"F Glover","year":"2003","unstructured":"Glover, F., Sherali, H.D.: Foundation-penalty cuts for mixed-integer programs. Oper. Res. Lett. 31, 245\u2013253 (2003)","journal-title":"Oper. Res. Lett."},{"key":"297_CR9","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1504\/IJCSE.2007.017826","volume":"3","author":"F Glover","year":"2007","unstructured":"Glover, F., Sherali, H.D.: A class of multi-level balanced foundation-penalty cuts for mixed-integer programs. Int. J. Comput. Sci. Eng. 3, 203\u2013210 (2007)","journal-title":"Int. J. Comput. Sci. Eng."},{"key":"297_CR10","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1023\/A:1008621204567","volume":"8","author":"F Glover","year":"1997","unstructured":"Glover, F., Sherali, H.D., Lee, Y.: Generating cuts from surrogate constraint analysis for zero\u2013one and multiple choice programming. Comput. Optim. Appl. 8, 151\u2013172 (1997)","journal-title":"Comput. Optim. Appl."},{"key":"297_CR11","volume-title":"Integer and Combinatorial Optimization","author":"GL Nemhauser","year":"2001","unstructured":"Nemhauser, G.L., Wolsey, L.A.: Integer and Combinatorial Optimization. Wiley Inc., New York, NY (2001)"},{"key":"297_CR12","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1137\/0403036","volume":"3","author":"HD Sherali","year":"1990","unstructured":"Sherali, H.D., Adams, W.P.: A hierarchy of relaxations between the continuous and convex hull representations for zero\u2013one programming problems. SIAM J. Discrete Math. 3, 411\u2013430 (1990)","journal-title":"SIAM J. Discrete Math."},{"key":"297_CR13","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/0166-218X(92)00190-W","volume":"52","author":"HD Sherali","year":"1994","unstructured":"Sherali, H.D., Adams, W.P.: A hierarchy of relaxations and convex hull characterizations for mixed-integer zero\u2013one programming problems. Discrete Appl. Math. 52, 83\u2013106 (1994)","journal-title":"Discrete Appl. Math."},{"key":"297_CR14","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1137\/S0895480192230607","volume":"8","author":"HD Sherali","year":"1995","unstructured":"Sherali, H.D., Lee, Y.: Sequential and simultaneous liftings of minimal cover inequalities for generalized upper bound constrained knapsack polytopes. SIAM J. Discrete Math. 8, 133\u2013153 (1995)","journal-title":"SIAM J. Discrete Math."},{"key":"297_CR15","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/0166-218X(95)00060-5","volume":"68","author":"HD Sherali","year":"1996","unstructured":"Sherali, H.D., Lee, Y.: Tighter representations for set partitioning problems. Discrete Appl. Math. 68, 153\u2013167 (1996)","journal-title":"Discrete Appl. Math."},{"key":"297_CR16","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/0167-6377(94)00065-E","volume":"17","author":"HD Sherali","year":"1995","unstructured":"Sherali, H.D., Lee, Y., Adams, W.P.: A simultaneous lifting strategy for identifying new classes of facets for the Boolean quadric polytope. Oper. Res. Lett. 17, 19\u201326 (1995)","journal-title":"Oper. Res. Lett."},{"key":"297_CR17","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1016\/j.ejor.2002.09.002","volume":"165","author":"HD Sherali","year":"2005","unstructured":"Sherali, H.D., Lee, Y., Kim, Y.: Partial convexification cuts for 0\u20131 mixed-integer programs. Eur. J. Oper. Res. 165, 625\u2013648 (2005)","journal-title":"Eur. J. Oper. Res."},{"key":"297_CR18","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/s10479-011-0883-6","volume":"210","author":"HD Sherali","year":"2013","unstructured":"Sherali, H.D., Lunday, B.J.: On generating maximal nondominated Benders cuts. Ann. Oper. Res. 210, 57\u201372 (2013)","journal-title":"Ann. Oper. Res."},{"key":"297_CR19","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/s11590-010-0255-1","volume":"6","author":"HD Sherali","year":"2012","unstructured":"Sherali, H.D., Smith, J.C.: Higher-level RLT or disjunctive cuts based on a partial enumeration strategy for 0\u20131 mixed-integer programs. Optim. Lett. 6, 127\u2013139 (2012)","journal-title":"Optim. Lett."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-015-0297-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-015-0297-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-015-0297-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-015-0297-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T00:59:09Z","timestamp":1559264349000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-015-0297-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,4,3]]},"references-count":19,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,10]]}},"alternative-id":["297"],"URL":"https:\/\/doi.org\/10.1007\/s10898-015-0297-0","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,4,3]]}}}