{"id":"https://openalex.org/W2169525491","doi":"https://doi.org/10.1080/10556780903057341","title":"A <i>p</i> -cone sequential relaxation procedure for 0-1 integer programs","display_name":"A <i>p</i> -cone sequential relaxation procedure for 0-1 integer programs","publication_year":2009,"publication_date":"2009-08-07","ids":{"openalex":"https://openalex.org/W2169525491","doi":"https://doi.org/10.1080/10556780903057341","mag":"2169525491"},"language":"en","primary_location":{"id":"doi:10.1080/10556780903057341","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556780903057341","pdf_url":null,"source":{"id":"https://openalex.org/S103047102","display_name":"Optimization methods & software","issn_l":"1026-7670","issn":["1026-7670","1029-4937","1055-6788"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Optimization Methods and Software","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5002663715","display_name":"Samuel Burer","orcid":"https://orcid.org/0000-0001-5886-458X"},"institutions":[{"id":"https://openalex.org/I126307644","display_name":"University of Iowa","ror":"https://ror.org/036jqmy94","country_code":"US","type":"education","lineage":["https://openalex.org/I126307644"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Samuel Burer","raw_affiliation_strings":["University of Iowa","Department of Management Sciences , University of Iowa , Iowa City, IA, 52242-1994, USA"],"affiliations":[{"raw_affiliation_string":"University of Iowa","institution_ids":["https://openalex.org/I126307644"]},{"raw_affiliation_string":"Department of Management Sciences , University of Iowa , Iowa City, IA, 52242-1994, USA","institution_ids":["https://openalex.org/I126307644"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5019122349","display_name":"Jieqiu Chen","orcid":null},"institutions":[{"id":"https://openalex.org/I126307644","display_name":"University of Iowa","ror":"https://ror.org/036jqmy94","country_code":"US","type":"education","lineage":["https://openalex.org/I126307644"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jieqiu Chen","raw_affiliation_strings":["University of Iowa","Department of Management Sciences , University of Iowa , Iowa City, IA, 52242-1994, USA"],"affiliations":[{"raw_affiliation_string":"University of Iowa","institution_ids":["https://openalex.org/I126307644"]},{"raw_affiliation_string":"Department of Management Sciences , University of Iowa , Iowa City, IA, 52242-1994, USA","institution_ids":["https://openalex.org/I126307644"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5002663715"],"corresponding_institution_ids":["https://openalex.org/I126307644"],"apc_list":null,"apc_paid":null,"fwci":2.8513,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.90435974,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"24","issue":"4-5","first_page":"523","last_page":"548"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9936000108718872,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10545","display_name":"Optimization and Variational Analysis","score":0.9696000218391418,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.7128636837005615},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.7011108994483948},{"id":"https://openalex.org/keywords/second-order-cone-programming","display_name":"Second-order cone programming","score":0.6887683868408203},{"id":"https://openalex.org/keywords/polytope","display_name":"Polytope","score":0.6862866878509521},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.6510134339332581},{"id":"https://openalex.org/keywords/convex-cone","display_name":"Convex cone","score":0.6494598388671875},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.6320710182189941},{"id":"https://openalex.org/keywords/cone","display_name":"Cone (formal languages)","score":0.6271342635154724},{"id":"https://openalex.org/keywords/convex-hull","display_name":"Convex hull","score":0.6002864837646484},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5649504661560059},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.5603494644165039},{"id":"https://openalex.org/keywords/hull","display_name":"Hull","score":0.5502323508262634},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.47001364827156067},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.4677187502384186},{"id":"https://openalex.org/keywords/order","display_name":"Order (exchange)","score":0.4456091821193695},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3974735736846924},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.39380455017089844},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.3754783570766449},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3336605429649353},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.26762455701828003},{"id":"https://openalex.org/keywords/convex-combination","display_name":"Convex combination","score":0.1490568220615387},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.1445792019367218}],"concepts":[{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.7128636837005615},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.7011108994483948},{"id":"https://openalex.org/C111397411","wikidata":"https://www.wikidata.org/wiki/Q7442977","display_name":"Second-order cone programming","level":4,"score":0.6887683868408203},{"id":"https://openalex.org/C145691206","wikidata":"https://www.wikidata.org/wiki/Q747980","display_name":"Polytope","level":2,"score":0.6862866878509521},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.6510134339332581},{"id":"https://openalex.org/C28340159","wikidata":"https://www.wikidata.org/wiki/Q2256541","display_name":"Convex cone","level":5,"score":0.6494598388671875},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.6320710182189941},{"id":"https://openalex.org/C30014739","wikidata":"https://www.wikidata.org/wiki/Q5159445","display_name":"Cone (formal languages)","level":2,"score":0.6271342635154724},{"id":"https://openalex.org/C206194317","wikidata":"https://www.wikidata.org/wiki/Q1138624","display_name":"Convex hull","level":3,"score":0.6002864837646484},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5649504661560059},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.5603494644165039},{"id":"https://openalex.org/C37423430","wikidata":"https://www.wikidata.org/wiki/Q6750281","display_name":"Hull","level":2,"score":0.5502323508262634},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.47001364827156067},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.4677187502384186},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.4456091821193695},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3974735736846924},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.39380455017089844},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.3754783570766449},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3336605429649353},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.26762455701828003},{"id":"https://openalex.org/C111110010","wikidata":"https://www.wikidata.org/wiki/Q2627315","display_name":"Convex combination","level":4,"score":0.1490568220615387},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.1445792019367218},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C199104240","wikidata":"https://www.wikidata.org/wiki/Q118291","display_name":"Marine engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/10556780903057341","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556780903057341","pdf_url":null,"source":{"id":"https://openalex.org/S103047102","display_name":"Optimization methods & software","issn_l":"1026-7670","issn":["1026-7670","1029-4937","1055-6788"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Optimization Methods and Software","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W171072194","https://openalex.org/W1481334272","https://openalex.org/W1503221585","https://openalex.org/W1504855531","https://openalex.org/W1520007244","https://openalex.org/W1568307856","https://openalex.org/W1606052501","https://openalex.org/W1632601927","https://openalex.org/W1963653477","https://openalex.org/W1967073510","https://openalex.org/W1967184028","https://openalex.org/W1967344706","https://openalex.org/W1970193303","https://openalex.org/W1980307085","https://openalex.org/W1992101048","https://openalex.org/W2007218093","https://openalex.org/W2009683816","https://openalex.org/W2009923109","https://openalex.org/W2023648834","https://openalex.org/W2035396114","https://openalex.org/W2043677016","https://openalex.org/W2049143039","https://openalex.org/W2052281387","https://openalex.org/W2054908450","https://openalex.org/W2068848618","https://openalex.org/W2106264302","https://openalex.org/W2117065890","https://openalex.org/W2257291892","https://openalex.org/W2296319761","https://openalex.org/W2607539118","https://openalex.org/W2914109978","https://openalex.org/W2916341692","https://openalex.org/W4250589301"],"related_works":["https://openalex.org/W2952452737","https://openalex.org/W4300637737","https://openalex.org/W2949225936","https://openalex.org/W4280532596","https://openalex.org/W4297030264","https://openalex.org/W2319630744","https://openalex.org/W2594358447","https://openalex.org/W3206492465","https://openalex.org/W3030201206","https://openalex.org/W2169525491"],"abstract_inverted_index":{"Several":[0],"authors":[1],"have":[2],"introduced":[3],"sequential":[4,38],"relaxation":[5,39],"techniques":[6],"\u2013":[7,14],"based":[8,43,90],"on":[9,44,91],"linear":[10,92,108],"and/or":[11],"semi-definite":[12,110],"programming":[13,47],"to":[15,82,105],"generate":[16],"the":[17,55,83,95,106],"convex":[18,56],"hull":[19,57],"of":[20,58,86,126],"0-1":[21,59],"integer":[22],"points":[23],"in":[24,27,99],"a":[25,37,119],"polytope":[26],"at":[28],"most":[29],"n":[30],"steps.":[31],"In":[32,62],"this":[33],"paper,":[34],"we":[35,64,112],"introduce":[36],"technique,":[40],"which":[41],"is":[42],"p-order":[45,96],"cone":[46,97],"(1\u2264p\u2264\u221e).":[48],"We":[49],"prove":[50],"that":[51,66,114],"our":[52,67,79,127],"technique":[53,128],"generates":[54],"solutions":[60],"asymptotically.":[61],"addition,":[63],"show":[65,113],"method":[68,80],"generalizes":[69],"and":[70,88,109],"subsumes":[71],"several":[72],"existing":[73],"methods.":[74],"For":[75],"example,":[76],"when":[77],"p=\u221e,":[78],"corresponds":[81],"well-known":[84],"procedure":[85],"Lov\u00e1sz":[87],"Schrijver":[89],"programming.":[93],"Although":[94],"programs":[98],"general":[100],"sacrifice":[101],"some":[102],"strength":[103],"compared":[104],"analogous":[107],"programs,":[111],"for":[115],"p=2":[116],"they":[117],"enjoy":[118],"better":[120],"theoretical":[121],"iteration":[122],"complexity.":[123],"Computational":[124],"considerations":[125],"are":[129],"discussed.":[130]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2014,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}