{"id":"https://openalex.org/W2147289288","doi":"https://doi.org/10.1002/9780470400531.eorms0233","title":"Decomposition Methods for Integer Programming","display_name":"Decomposition Methods for Integer Programming","publication_year":2011,"publication_date":"2011-01-01","ids":{"openalex":"https://openalex.org/W2147289288","doi":"https://doi.org/10.1002/9780470400531.eorms0233","mag":"2147289288"},"language":"en","primary_location":{"id":"doi:10.1002/9780470400531.eorms0233","doi":"https://doi.org/10.1002/9780470400531.eorms0233","is_oa":false,"landing_page_url":"https://doi.org/10.1002/9780470400531.eorms0233","pdf_url":null,"source":{"id":"https://openalex.org/S4306464293","display_name":"Wiley eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Wiley Encyclopedia of Operations Research and Management Science","raw_type":"other"},"volume":{"id":"https://openalex.org/W1481170590","display_name":"Wiley Encyclopedia of Operations Research and Management Science"},"type":"reference-entry","is_traditional":false,"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/A5080991298","display_name":"Ted K. Ralphs","orcid":"https://orcid.org/0000-0002-4306-9089","observed_orcids":["https://orcid.org/0000-0002-4306-9089"]},"institutions":[{"id":"https://openalex.org/I186143895","display_name":"Lehigh University","ror":"https://ror.org/012afjb06","country_code":"US","type":"education","lineage":["https://openalex.org/I186143895"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ted K. Ralphs","raw_affiliation_strings":["Lehigh University, Department of Industrial and Systems Engineering, Bethlehem, Pennsylvania"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Lehigh University, Department of Industrial and Systems Engineering, Bethlehem, Pennsylvania","institution_ids":["https://openalex.org/I186143895"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5022323684","display_name":"Matthew V. Galati","orcid":"https://orcid.org/0000-0002-8311-4470","observed_orcids":["https://orcid.org/0000-0002-8311-4470"]},"institutions":[{"id":"https://openalex.org/I122754148","display_name":"SAS Institute (United States)","ror":"https://ror.org/01093z329","country_code":"US","type":"company","lineage":["https://openalex.org/I122754148"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Matthew V. Galati","raw_affiliation_strings":["SAS Institute, Advanced Analytics - Operations R & D, Chesterbrook, Pennsylvania"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"SAS Institute, Advanced Analytics - Operations R & D, Chesterbrook, Pennsylvania","institution_ids":["https://openalex.org/I122754148"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9560999870300293,"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.9560999870300293,"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.016899999231100082,"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/T12709","display_name":"Optimization and Mathematical Programming","score":0.01140000019222498,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/decomposition-method","display_name":"decomposition method","score":0.8889999985694885},{"id":"https://openalex.org/keywords/mixed-integer-linear-programming","display_name":"mixed-integer linear programming","score":0.9890000224113464},{"id":"https://openalex.org/keywords/dantzig-wolfe-decomposition","display_name":"Dantzig-Wolfe decomposition","score":0.9290000200271606},{"id":"https://openalex.org/keywords/lagrangian-relaxation","display_name":"Lagrangian relaxation","score":0.9959999918937683},{"id":"https://openalex.org/keywords/cutting-plane-method","display_name":"cutting plane method","score":0.8920000195503235},{"id":"https://openalex.org/keywords/benders-decomposition","display_name":"Benders decomposition","score":0.8769999742507935},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"branch and bound","score":0.6740000247955322},{"id":"https://openalex.org/keywords/constraint-relaxation","display_name":"constraint relaxation","score":0.6359999775886536},{"id":"https://openalex.org/keywords/lower-bounds","display_name":"lower bounds","score":0.5059999823570251}],"concepts":[{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.7226617932319641},{"id":"https://openalex.org/C109839438","wikidata":"https://www.wikidata.org/wiki/Q1762039","display_name":"Cutting-plane method","level":3,"score":0.7169008255004883},{"id":"https://openalex.org/C63584917","wikidata":"https://www.wikidata.org/wiki/Q333286","display_name":"Bounding overwatch","level":2,"score":0.7022954225540161},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.685081422328949},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6646586656570435},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.5990715026855469},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.5602519512176514},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5587829351425171},{"id":"https://openalex.org/C99679407","wikidata":"https://www.wikidata.org/wiki/Q56761637","display_name":"Substructure","level":2,"score":0.5585614442825317},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5478822588920593},{"id":"https://openalex.org/C91765299","wikidata":"https://www.wikidata.org/wiki/Q3424292","display_name":"Lagrangian relaxation","level":2,"score":0.5370371341705322},{"id":"https://openalex.org/C2778258933","wikidata":"https://www.wikidata.org/wiki/Q16918986","display_name":"Decomposition method (queueing theory)","level":2,"score":0.48805201053619385},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.47438982129096985},{"id":"https://openalex.org/C123558587","wikidata":"https://www.wikidata.org/wiki/Q4956382","display_name":"Branch and price","level":3,"score":0.43235617876052856},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.4317905604839325},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3724561631679535},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3410642743110657},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.12476193904876709},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.07538452744483948},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.05669373273849487},{"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/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","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/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/9780470400531.eorms0233","doi":"https://doi.org/10.1002/9780470400531.eorms0233","is_oa":false,"landing_page_url":"https://doi.org/10.1002/9780470400531.eorms0233","pdf_url":null,"source":{"id":"https://openalex.org/S4306464293","display_name":"Wiley eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Wiley Encyclopedia of Operations Research and Management Science","raw_type":"other"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":39,"referenced_works":["https://openalex.org/W1970355999","https://openalex.org/W1973565128","https://openalex.org/W1979743058","https://openalex.org/W1988044254","https://openalex.org/W1992439238","https://openalex.org/W1993756010","https://openalex.org/W1999895824","https://openalex.org/W2005926129","https://openalex.org/W2006743657","https://openalex.org/W2009683816","https://openalex.org/W2009803313","https://openalex.org/W2013946649","https://openalex.org/W2016379692","https://openalex.org/W2022065551","https://openalex.org/W2029242918","https://openalex.org/W2039823842","https://openalex.org/W2042478958","https://openalex.org/W2059961050","https://openalex.org/W2069808690","https://openalex.org/W2096796578","https://openalex.org/W2097192020","https://openalex.org/W2097685766","https://openalex.org/W2105560970","https://openalex.org/W2114844199","https://openalex.org/W2120018445","https://openalex.org/W2139346168","https://openalex.org/W2144946856","https://openalex.org/W2167580124","https://openalex.org/W2171830873","https://openalex.org/W2399100674","https://openalex.org/W2505968561","https://openalex.org/W2622576046","https://openalex.org/W2913988959","https://openalex.org/W4231610975","https://openalex.org/W4236384091","https://openalex.org/W4242003284","https://openalex.org/W4242130683","https://openalex.org/W4253845860","https://openalex.org/W4254510866"],"related_works":["https://openalex.org/W7100370032","https://openalex.org/W7155630692","https://openalex.org/W1587922356","https://openalex.org/W7214142649","https://openalex.org/W57658612","https://openalex.org/W7217766571","https://openalex.org/W4244863679","https://openalex.org/W4400083923","https://openalex.org/W1872737999","https://openalex.org/W2092410161"],"abstract_inverted_index":{"Abstract":[0],"This":[1,85,121,129],"article":[2,130],"reviews":[3,131],"both":[4],"traditional":[5],"and":[6,96,139],"integrated":[7],"decomposition":[8,132],"methods":[9,16,38,56],"for":[10,62],"solving":[11],"mixed\u2010integer":[12,147],"linear":[13,148],"programs.":[14,149],"These":[15],"attempt":[17],"to":[18,27,35,50,78,145],"exploit":[19],"tractable":[20],"substructures":[21],"of":[22,39,66,82,108,111,117,137],"the":[23,41,58,71,87,91,106,118,123],"problem":[24],"in":[25],"order":[26],"obtain":[28],"improved":[29,37],"solution":[30,43,60],"procedures.":[31],"The":[32],"goal":[33],"is":[34,77,86,122],"derive":[36],"bounding":[40],"optimal":[42],"value,":[44],"which":[45],"can":[46,100],"then":[47],"be":[48,102],"used":[49,144],"drive":[51],"a":[52,63,74,80,109],"branch\u2010and\u2010bound":[53],"algorithm.":[54],"Such":[55],"are":[57,143],"preferred":[59],"approaches":[61],"wide":[64],"range":[65],"important":[67],"models.":[68],"To":[69],"expose":[70],"desired":[72],"substructure,":[73],"common":[75],"approach":[76,88,124],"relax":[79],"set":[81,110],"complicating":[83],"constraints.":[84],"taken":[89,125],"by":[90,104,126],"Dantzig\u2013Wolfe":[92],"decomposition,":[93],"Lagrangian":[94],"relaxation,":[95],"cutting\u2010plane":[97],"methods.":[98],"Substructure":[99],"also":[101],"exposed":[103],"relaxing":[105],"values":[107],"variables,":[112],"that":[113],"is,":[114],"considering":[115],"restrictions":[116],"original":[119],"problem.":[120],"Benders'":[127],"decomposition.":[128],"methodologies":[133],"based":[134],"on":[135],"relaxation":[136],"constraints":[138],"examines":[140],"how":[141],"they":[142],"solve":[146]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2026-11-07T11:25:07.637180","created_date":"2016-06-24T00:00:00"}