{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T06:44:42Z","timestamp":1772779482554,"version":"3.50.1"},"reference-count":29,"publisher":"Informa UK Limited","issue":"4-5","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Optimization Methods and Software"],"published-print":{"date-parts":[[2009,10]]},"DOI":"10.1080\/10556780903057341","type":"journal-article","created":{"date-parts":[[2009,8,14]],"date-time":"2009-08-14T00:41:11Z","timestamp":1250210471000},"page":"523-548","source":"Crossref","is-referenced-by-count":6,"title":["A\n                    <i>p<\/i>\n                    -cone sequential relaxation procedure for 0-1 integer programs"],"prefix":"10.1080","volume":"24","author":[{"given":"Samuel","family":"Burer","sequence":"first","affiliation":[{"name":"University of Iowa","place":["USA"]}]},{"given":"Jieqiu","family":"Chen","sequence":"additional","affiliation":[{"name":"University of Iowa","place":["USA"]}]}],"member":"301","published-online":{"date-parts":[[2009,8,7]]},"reference":[{"issue":"4","key":"e_1_3_2_2_1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.orl.2005.07.009","article-title":"MIPLIB 2003","volume":"34","author":"Achterberg T.","year":"2006","unstructured":"Achterberg , T. , Koch , T. and Martin , A. 2006 . MIPLIB 2003 . Oper. Res. Lett. , 34 ( 4 ) : 1 \u2013 12 . Available at http:\/\/www.zib.de\/Publications\/abstracts\/ZR-05-28\/. See http:\/\/miplib.zib.de","journal-title":"Oper. Res. Lett."},{"key":"e_1_3_2_3_1","first-page":"3","volume-title":"Math. Program","author":"Alizadeh F.","year":"2003","unstructured":"Alizadeh , F. and Goldfarb , D. 2003 . \u201c Second-order cone programming \u201d . In Math. Program Vol. 95 , 3 \u2013 51 . Atlanta, GA (1, Ser. B), ISMP 2000, Part 3"},{"key":"e_1_3_2_4_1","doi-asserted-by":"publisher","DOI":"10.1080\/0233193021000030751"},{"key":"e_1_3_2_5_1","volume-title":"Linear programming in infinite-dimensional spaces. Wiley-interscience series in discrete mathematics and optimization, Theory and Applications","author":"Anderson E. J.","year":"1987","unstructured":"Anderson , E. J. and Nash , P. 1987 . Linear programming in infinite-dimensional spaces. Wiley-interscience series in discrete mathematics and optimization, Theory and Applications , Chichester : A Wiley-Interscience Publication, John Wiley & Sons Ltd ."},{"issue":"2","key":"e_1_3_2_6_1","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/s10107-002-0317-y","article-title":"A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer Gomory cuts for 0-1 programming","volume":"94","author":"Balas E.","year":"2003","unstructured":"Balas , E. and Perregaard , M. 2003 . A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer Gomory cuts for 0-1 programming . Math. Program. , 94 ( 2\u20133, Ser. B ) : 221 \u2013 245 . The Aussois 2000 Workshop in Combinatorial Optimization","journal-title":"Math. Program."},{"key":"e_1_3_2_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01581273"},{"key":"e_1_3_2_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718829"},{"issue":"1","key":"e_1_3_2_9_1","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1137\/S1052623402420346","article-title":"Subset algebra lift operators for 0-1 integer programming","volume":"15","author":"Bienstock D.","year":"2004","unstructured":"Bienstock , D. and Zuckerberg , M. 2004 . Subset algebra lift operators for 0-1 integer programming . SIAM J. Optim. , 15 ( 1 ) : 63 \u2013 95 . (electronic)","journal-title":"SIAM J. Optim."},{"key":"e_1_3_2_10_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441"},{"issue":"3","key":"e_1_3_2_11_1","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1137\/040609574","article-title":"Solving lift-and-project relaxations of binary integer programs","volume":"16","author":"Burer S.","year":"2006","unstructured":"Burer , S. and Vandenbussche , D. 2006 . Solving lift-and-project relaxations of binary integer programs . SIAM J. Optim. , 16 ( 3 ) : 493 \u2013 512 .","journal-title":"SIAM J. Optim."},{"key":"e_1_3_2_12_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:JOTA.0000042522.65261.51"},{"key":"e_1_3_2_13_1","first-page":"269","volume-title":"Recent Advances in Mathematical Programming","author":"Gomory R. E.","year":"1963","unstructured":"Gomory , R. E. 1963 . \u201c An algorithm for integer solutions to linear programs \u201d . In Recent Advances in Mathematical Programming , Edited by: Graves , R. and Wolfe , P. 269 \u2013 302 . New York : McGraw-Hill ."},{"key":"e_1_3_2_14_1","doi-asserted-by":"publisher","DOI":"10.1090\/dimacs\/026"},{"key":"e_1_3_2_15_1","doi-asserted-by":"publisher","DOI":"10.1080\/10556780108805819"},{"key":"e_1_3_2_16_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1025794313696"},{"key":"e_1_3_2_17_1","doi-asserted-by":"publisher","DOI":"10.1080\/1055678031000148696"},{"key":"e_1_3_2_18_1","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623498336450"},{"issue":"1","key":"e_1_3_2_19_1","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/PL00011394","article-title":"Discretization and localization in successive convex relaxation methods for nonconvex quadratic optimization","volume":"89","author":"Kojima M.","year":"2000","unstructured":"Kojima , M. and Tun\u00e7el , L. 2000 . Discretization and localization in successive convex relaxation methods for nonconvex quadratic optimization . Math. Program. , 89 ( 1, Ser. A ) : 79 \u2013 111 . ISSN 0025-5610","journal-title":"Math. Program."},{"key":"e_1_3_2_20_1","volume-title":"Risk optimization with p-order conic constraints: a linear programming approach","author":"Krokhmal P.","year":"2008","unstructured":"Krokhmal , P. and Soberanis , P. 2008 . Risk optimization with p-order conic constraints: a linear programming approach , Iowa City, IA : University of Iowa . Working paper"},{"key":"e_1_3_2_21_1","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623400366802"},{"key":"e_1_3_2_22_1","doi-asserted-by":"publisher","DOI":"10.1137\/0801013"},{"key":"e_1_3_2_23_1","unstructured":"MOSEK Inc. 2007 . The MOSEK optimization tools manual 5.0 ."},{"key":"e_1_3_2_24_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970791"},{"key":"e_1_3_2_25_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.22.1.1"},{"key":"e_1_3_2_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-003-0387-5"},{"key":"e_1_3_2_27_1","doi-asserted-by":"publisher","DOI":"10.1137\/0403036"},{"key":"e_1_3_2_28_1","doi-asserted-by":"publisher","DOI":"10.1080\/10556789908805766"},{"key":"e_1_3_2_29_1","unstructured":"T\u00fct\u00fcnc\u00fc R. H. Toh K. C. and Todd M. J. 2001 . SDPT3: a Matlab software package for semidefinite-quadratic-linear programming version 3.0 . August Available at http:\/\/www.math.nus.edu.sg\/~mattohkc\/sdpt3.html"},{"key":"e_1_3_2_30_1","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623497327088"}],"container-title":["Optimization Methods and Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/10556780903057341","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T05:38:19Z","timestamp":1772775499000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.tandfonline.com\/doi\/full\/10.1080\/10556780903057341"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,8,7]]},"references-count":29,"journal-issue":{"issue":"4-5","published-print":{"date-parts":[[2009,10]]}},"alternative-id":["10.1080\/10556780903057341"],"URL":"https:\/\/doi.org\/10.1080\/10556780903057341","relation":{},"ISSN":["1055-6788","1029-4937"],"issn-type":[{"value":"1055-6788","type":"print"},{"value":"1029-4937","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,8,7]]}}}