{"id":"https://openalex.org/W4390581838","doi":"https://doi.org/10.1287/ijoc.2022.0241","title":"Solving a Class of Cut-Generating Linear Programs via Machine Learning","display_name":"Solving a Class of Cut-Generating Linear Programs via Machine Learning","publication_year":2024,"publication_date":"2024-01-04","ids":{"openalex":"https://openalex.org/W4390581838","doi":"https://doi.org/10.1287/ijoc.2022.0241"},"language":"en","primary_location":{"id":"doi:10.1287/ijoc.2022.0241","is_oa":false,"landing_page_url":"https://doi.org/10.1287/ijoc.2022.0241","pdf_url":null,"source":{"id":"https://openalex.org/S165318533","display_name":"INFORMS journal on computing","issn_l":"0899-1499","issn":["0899-1499","1091-9856","1526-5528","2326-3245"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315699","host_organization_name":"Institute for Operations Research and the Management Sciences","host_organization_lineage":["https://openalex.org/P4310315699"],"host_organization_lineage_names":["Institute for Operations Research and the Management Sciences"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"INFORMS Journal on Computing","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/A5080578329","display_name":"Atefeh Rajabalizadeh","orcid":null},"institutions":[{"id":"https://openalex.org/I173911158","display_name":"Iowa State University","ror":"https://ror.org/04rswrd78","country_code":"US","type":"education","lineage":["https://openalex.org/I173911158"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Atefeh Rajabalizadeh","raw_affiliation_strings":["Department of Industrial and Manufacturing Systems Engineering, Iowa State University, Ames, Iowa 50011"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Industrial and Manufacturing Systems Engineering, Iowa State University, Ames, Iowa 50011","institution_ids":["https://openalex.org/I173911158"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5029812131","display_name":"Danial Davarnia","orcid":"https://orcid.org/0000-0002-8602-4454"},"institutions":[{"id":"https://openalex.org/I173911158","display_name":"Iowa State University","ror":"https://ror.org/04rswrd78","country_code":"US","type":"education","lineage":["https://openalex.org/I173911158"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Danial Davarnia","raw_affiliation_strings":["Department of Industrial and Manufacturing Systems Engineering, Iowa State University, Ames, Iowa 50011"],"raw_orcid":"https://orcid.org/0000-0002-8602-4454","affiliations":[{"raw_affiliation_string":"Department of Industrial and Manufacturing Systems Engineering, Iowa State University, Ames, Iowa 50011","institution_ids":["https://openalex.org/I173911158"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I173911158"],"apc_list":null,"apc_paid":null,"fwci":1.1529,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.78219602,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":95,"max":98},"biblio":{"volume":"36","issue":"3","first_page":"708","last_page":"722"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9966999888420105,"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"}},"topics":[{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9966999888420105,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9919000267982483,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9879999756813049,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/cutting-plane-method","display_name":"Cutting-plane method","score":0.7668917179107666},{"id":"https://openalex.org/keywords/branch-and-cut","display_name":"Branch and cut","score":0.6407012939453125},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.6046134829521179},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5511108636856079},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5480118989944458},{"id":"https://openalex.org/keywords/oracle","display_name":"Oracle","score":0.5312392711639404},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.5070710182189941},{"id":"https://openalex.org/keywords/support-vector-machine","display_name":"Support vector machine","score":0.5053485035896301},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4778285026550293},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4649793803691864},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.4413861334323883},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4324217140674591},{"id":"https://openalex.org/keywords/maximum-cut","display_name":"Maximum cut","score":0.412866473197937},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.38997137546539307},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.38301438093185425},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.38186904788017273},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.3633779287338257},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.33468925952911377},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.18449357151985168}],"concepts":[{"id":"https://openalex.org/C109839438","wikidata":"https://www.wikidata.org/wiki/Q1762039","display_name":"Cutting-plane method","level":3,"score":0.7668917179107666},{"id":"https://openalex.org/C50797617","wikidata":"https://www.wikidata.org/wiki/Q498566","display_name":"Branch and cut","level":3,"score":0.6407012939453125},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.6046134829521179},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5511108636856079},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5480118989944458},{"id":"https://openalex.org/C55166926","wikidata":"https://www.wikidata.org/wiki/Q2892946","display_name":"Oracle","level":2,"score":0.5312392711639404},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.5070710182189941},{"id":"https://openalex.org/C12267149","wikidata":"https://www.wikidata.org/wiki/Q282453","display_name":"Support vector machine","level":2,"score":0.5053485035896301},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4778285026550293},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4649793803691864},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.4413861334323883},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4324217140674591},{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.412866473197937},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38997137546539307},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.38301438093185425},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.38186904788017273},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.3633779287338257},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.33468925952911377},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.18449357151985168},{"id":"https://openalex.org/C115903868","wikidata":"https://www.wikidata.org/wiki/Q80993","display_name":"Software engineering","level":1,"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1287/ijoc.2022.0241","is_oa":false,"landing_page_url":"https://doi.org/10.1287/ijoc.2022.0241","pdf_url":null,"source":{"id":"https://openalex.org/S165318533","display_name":"INFORMS journal on computing","issn_l":"0899-1499","issn":["0899-1499","1091-9856","1526-5528","2326-3245"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315699","host_organization_name":"Institute for Operations Research and the Management Sciences","host_organization_lineage":["https://openalex.org/P4310315699"],"host_organization_lineage_names":["Institute for Operations Research and the Management Sciences"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"INFORMS Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:RePEc:inm:orijoc:v:36:y:2024:i:3:p:708-722","is_oa":false,"landing_page_url":"http://doi.org/10.1287/ijoc.2022.0241","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W80602063","https://openalex.org/W1564803313","https://openalex.org/W1626155273","https://openalex.org/W1972997295","https://openalex.org/W1996908140","https://openalex.org/W2007407491","https://openalex.org/W2076535438","https://openalex.org/W2091847830","https://openalex.org/W2098432798","https://openalex.org/W2559690684","https://openalex.org/W2576311753","https://openalex.org/W2798566347","https://openalex.org/W3006199842","https://openalex.org/W3121525042","https://openalex.org/W4213062745","https://openalex.org/W4220670571","https://openalex.org/W4252017042","https://openalex.org/W4253741566","https://openalex.org/W4300568640"],"related_works":["https://openalex.org/W3006617646","https://openalex.org/W2379672298","https://openalex.org/W2387389269","https://openalex.org/W3162501176","https://openalex.org/W3104290058","https://openalex.org/W4310251946","https://openalex.org/W4303982878","https://openalex.org/W2089185195","https://openalex.org/W1464660497","https://openalex.org/W3013962532"],"abstract_inverted_index":{"Cut-generating":[0],"linear":[1],"programs":[2],"(CGLPs)":[3],"play":[4],"a":[5,9,67,78,103,116,122,129,161,225,241],"key":[6],"role":[7],"as":[8,138,191],"separation":[10],"oracle":[11],"to":[12,34,56,110,164,224,234],"produce":[13],"valid":[14],"inequalities":[15],"for":[16,170,239,250],"the":[17,27,43,46,49,57,64,112,132,136,143,171,177,198,206,231,236],"feasible":[18],"region":[19],"of":[20,48,60,66,87,115,131,142,212,228,254],"mixed-integer":[21],"programs.":[22],"When":[23],"incorporated":[24],"inside":[25],"branch-and-bound,":[26],"cutting":[28,75,123,214],"planes":[29],"obtained":[30,201],"from":[31,202],"CGLPs":[32,44,80],"help":[33],"tighten":[35],"relaxations":[36],"and":[37,63],"improve":[38,205],"dual":[39,96],"bounds.":[40,97],"However,":[41],"running":[42],"at":[45,84,128,262],"nodes":[47,72,229],"branch-and-bound":[50,133,232],"tree":[51,233],"is":[52,260],"computationally":[53],"cumbersome":[54],"due":[55],"large":[58,226],"number":[59,227],"node":[61,130],"candidates":[62,238],"lack":[65],"priori":[68],"knowledge":[69],"on":[70,94,107,176,184],"which":[71],"admit":[73],"useful":[74],"planes.":[76],"As":[77],"result,":[79],"are":[81],"often":[82],"avoided":[83],"default":[85],"settings":[86],"branch-and-cut":[88],"algorithms":[89],"despite":[90],"their":[91],"potential":[92],"impact":[93],"improving":[95],"In":[98],"this":[99],"paper,":[100],"we":[101,147],"propose":[102],"novel":[104],"framework":[105,219],"based":[106,175],"machine":[108],"learning":[109],"approximate":[111,199],"optimal":[113],"value":[114],"CGLP":[117,137,178,200],"class":[118],"that":[119,149,197,211],"determines":[120],"whether":[121],"plane":[124,215],"can":[125,151,204,220],"be":[126,152,221],"generated":[127],"tree.":[134],"Translating":[135],"an":[139],"indicator":[140],"function":[141,145],"objective":[144],"vector,":[146],"show":[148],"it":[150],"approximated":[153],"through":[154],"conventional":[155,213],"data":[156,168],"classification":[157,173,188,203],"techniques.":[158],"We":[159,180],"provide":[160],"systematic":[162],"procedure":[163],"efficiently":[165,222],"generate":[166],"training":[167],"sets":[169],"corresponding":[172],"problem":[174],"structure.":[179],"conduct":[181],"computational":[182],"experiments":[183],"benchmark":[185],"instances":[186],"using":[187],"methods":[189],"such":[190],"logistic":[192],"regression.":[193],"These":[194],"results":[195],"suggest":[196],"solution":[207],"time":[208],"compared":[209],"with":[210],"methods.":[216],"Our":[217],"proposed":[218],"applied":[223],"in":[230],"identify":[235],"best":[237],"adding":[240],"cut.":[242],"History:":[243],"Accepted":[244],"by":[245],"Andrea":[246],"Lodi,":[247],"Area":[248],"Editor":[249],"Design":[251],"&":[252],"Analysis":[253],"Algorithms\u2014Discrete.":[255],"Supplemental":[256],"Material:":[257],"The":[258],"e-companion":[259],"available":[261],"https://doi.org/10.1287/ijoc.2022.0241":[263],".":[264]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":2}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}