{"id":"https://openalex.org/W4244863679","doi":"https://doi.org/10.1201/9781420039597.ch4","title":"Decomposition in Integer Linear Programming","display_name":"Decomposition in Integer Linear Programming","publication_year":2005,"publication_date":"2005-09-22","ids":{"openalex":"https://openalex.org/W4244863679","doi":"https://doi.org/10.1201/9781420039597.ch4"},"language":"en","primary_location":{"id":"doi:10.1201/9781420039597.ch4","doi":"https://doi.org/10.1201/9781420039597.ch4","is_oa":false,"landing_page_url":"https://doi.org/10.1201/9781420039597.ch4","pdf_url":null,"source":{"id":"https://openalex.org/S4210196734","display_name":"Operations research series","issn_l":"2155-0239","issn":["2155-0239","2379-2175"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310320584","host_organization_name":"CRC Press","host_organization_lineage":["https://openalex.org/P4310320584","https://openalex.org/P4310320547"],"host_organization_lineage_names":["CRC Press","Taylor & Francis"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Operations Research Series","raw_type":"book-chapter"},"volume":{"id":"https://openalex.org/W655935858","display_name":"Integer Programming"},"type":"book-chapter","is_traditional":true,"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/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 Galati","raw_affiliation_strings":["Analytical Solutions -Operations R & D, SAS Institute, Cary, NC 27513"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Analytical Solutions -Operations R & D, SAS Institute, Cary, NC 27513","institution_ids":["https://openalex.org/I122754148"]}]},{"author_position":"last","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":true,"raw_author_name":"Ted Ralphs","raw_affiliation_strings":["Department of Industrial and Systems Engineering, Lehigh University, Bethlehem, PA 18015,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Industrial and Systems Engineering, Lehigh University, Bethlehem, PA 18015,","institution_ids":["https://openalex.org/I186143895"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5080991298"],"corresponding_institution_ids":["https://openalex.org/I186143895"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"57","last_page":"110"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.7172999978065491,"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.7172999978065491,"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.25099998712539673,"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.006399999838322401,"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/integer-linear-programming","display_name":"integer linear programming","score":0.9929999709129333},{"id":"https://openalex.org/keywords/decomposition-method","display_name":"decomposition method","score":0.8840000033378601},{"id":"https://openalex.org/keywords/cutting-plane-method","display_name":"cutting plane method","score":0.8080000281333923},{"id":"https://openalex.org/keywords/bounding-methods","display_name":"bounding methods","score":0.5799999833106995},{"id":"https://openalex.org/keywords/convex-hull-approximation","display_name":"convex hull approximation","score":0.8999999761581421},{"id":"https://openalex.org/keywords/continuous-relaxation","display_name":"continuous relaxation","score":0.7009999752044678},{"id":"https://openalex.org/keywords/valid-inequalities","display_name":"valid inequalities","score":0.9570000171661377},{"id":"https://openalex.org/keywords/polyhedral-approximation","display_name":"polyhedral approximation","score":0.5519999861717224}],"concepts":[{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.7467485070228577},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.7027567625045776},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5134654641151428},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.45698311924934387},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4409904181957245},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.34718430042266846},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3323047161102295},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.2869102954864502},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.07459709048271179},{"id":"https://openalex.org/C178790620","wikidata":"https://www.wikidata.org/wiki/Q11351","display_name":"Organic chemistry","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1201/9781420039597.ch4","doi":"https://doi.org/10.1201/9781420039597.ch4","is_oa":false,"landing_page_url":"https://doi.org/10.1201/9781420039597.ch4","pdf_url":null,"source":{"id":"https://openalex.org/S4210196734","display_name":"Operations research series","issn_l":"2155-0239","issn":["2155-0239","2379-2175"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310320584","host_organization_name":"CRC Press","host_organization_lineage":["https://openalex.org/P4310320584","https://openalex.org/P4310320547"],"host_organization_lineage_names":["CRC Press","Taylor & Francis"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Operations Research Series","raw_type":"book-chapter"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.387.7770","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.387.7770","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://coral.ie.lehigh.edu/~magh/pub/Chapter4.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.387.8311","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.387.8311","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://coral.ie.lehigh.edu/~magh/pub/DECOMP04.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.67.8054","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.67.8054","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.lehigh.edu/~tkr2/research/papers/DECOMP04.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.70.1719","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.70.1719","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.lehigh.edu/~tkr2/research/papers/DECOMP04.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":47,"referenced_works":["https://openalex.org/W89486219","https://openalex.org/W1501435780","https://openalex.org/W1535844088","https://openalex.org/W1540760152","https://openalex.org/W1586016561","https://openalex.org/W1616696029","https://openalex.org/W1652378708","https://openalex.org/W1663519530","https://openalex.org/W1969471641","https://openalex.org/W1973565128","https://openalex.org/W1977545325","https://openalex.org/W1979743058","https://openalex.org/W1994629867","https://openalex.org/W1999578543","https://openalex.org/W1999846426","https://openalex.org/W2005944337","https://openalex.org/W2006743657","https://openalex.org/W2009803313","https://openalex.org/W2011039300","https://openalex.org/W2012329067","https://openalex.org/W2015681706","https://openalex.org/W2017070898","https://openalex.org/W2017927472","https://openalex.org/W2022901437","https://openalex.org/W2033662447","https://openalex.org/W2039823842","https://openalex.org/W2042478958","https://openalex.org/W2050014122","https://openalex.org/W2097685766","https://openalex.org/W2105560970","https://openalex.org/W2106995649","https://openalex.org/W2111563176","https://openalex.org/W2114844199","https://openalex.org/W2134143366","https://openalex.org/W2137460743","https://openalex.org/W2139346168","https://openalex.org/W2165517980","https://openalex.org/W2167580124","https://openalex.org/W2171830873","https://openalex.org/W2173169029","https://openalex.org/W2288493426","https://openalex.org/W2505968561","https://openalex.org/W2529629665","https://openalex.org/W2529968603","https://openalex.org/W4230496880","https://openalex.org/W4236384091","https://openalex.org/W4256046638"],"related_works":["https://openalex.org/W7214142649","https://openalex.org/W1988044254","https://openalex.org/W7217766571","https://openalex.org/W7098400315","https://openalex.org/W7097913712","https://openalex.org/W7100370032","https://openalex.org/W2147289288","https://openalex.org/W2394158312","https://openalex.org/W4247811732","https://openalex.org/W7096745488"],"abstract_inverted_index":{"Both":[0],"cutting":[1],"plane":[2],"methods":[3,7,81,142],"and":[4,73,125,147],"traditional":[5,92],"decomposition":[6,84],"are":[8],"procedures":[9,72],"that":[10],"compute":[11],"a":[12,59,76,99,136],"bound":[13,89],"on":[14],"the":[15,29,41,45,88,107,116,141,145,149,152],"optimal":[16],"value":[17],"of":[18,32,61,79,109,154],"an":[19,26,50,54],"integer":[20],"linear":[21],"program":[22],"(ILP)":[23],"by":[24,39,91,97],"constructing":[25],"approximation":[27,36],"to":[28,115,128],"convex":[30],"hull":[31],"feasible":[33],"solutions.":[34],"This":[35],"is":[37,94,113,126],"obtained":[38],"intersecting":[40],"polyhedron":[42,57],"associated":[43],"with":[44,53],"continuous":[46],"relaxation,":[47],"which":[48,87,112],"has":[49],"explicit":[51],"representation,":[52],"implicitly":[55,101],"defined":[56,102],"having":[58],"description":[60],"exponential":[62],"size.":[63],"In":[64],"this":[65],"paper,":[66],"we":[67,133],"first":[68],"review":[69],"these":[70],"classical":[71],"then":[74],"introduce":[75,135],"new":[77],"class":[78],"bounding":[80],"called":[82],"integrated":[83],"methods,":[85],"in":[86,144],"yielded":[90],"approaches":[93],"potentially":[95],"improved":[96],"introducing":[98],"second":[100],"polyhedron.":[103],"We":[104],"also":[105],"discuss":[106],"concept":[108],"structured":[110],"separation,":[111],"related":[114],"well-known":[117],"template":[118],"paradigm":[119],"for":[120,139],"dynamically":[121],"generating":[122],"valid":[123],"inequalities":[124],"central":[127],"our":[129],"algorithmic":[130],"framework.":[131],"Finally,":[132],"briefly":[134],"software":[137],"framework":[138],"implementing":[140],"discussed":[143],"paper":[146],"illustrate":[148],"concepts":[150],"through":[151],"presentation":[153],"applications.":[155],"1":[156]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-11-04T10:54:05.112534","created_date":"2022-05-12T00:00:00"}
