{"id":"https://openalex.org/W2072675086","doi":"https://doi.org/10.1137/s1052623497318700","title":"Inexact Cuts in Benders Decomposition","display_name":"Inexact Cuts in Benders Decomposition","publication_year":2000,"publication_date":"2000-01-01","ids":{"openalex":"https://openalex.org/W2072675086","doi":"https://doi.org/10.1137/s1052623497318700","mag":"2072675086"},"language":"en","primary_location":{"id":"doi:10.1137/s1052623497318700","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s1052623497318700","pdf_url":null,"source":{"id":"https://openalex.org/S928796702","display_name":"SIAM Journal on Optimization","issn_l":"1052-6234","issn":["1052-6234","1095-7189"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Optimization","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/A5004039675","display_name":"Golbon Zakeri","orcid":"https://orcid.org/0000-0002-6888-8451"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Golbon Zakeri","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5083158688","display_name":"Andy Philpott","orcid":"https://orcid.org/0000-0002-7094-3405"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Andrew B. Philpott","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5113994565","display_name":"David M. Ryan","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"David M. Ryan","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5004039675"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.986,"has_fulltext":false,"cited_by_count":94,"citation_normalized_percentile":{"value":0.87877327,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"10","issue":"3","first_page":"643","last_page":"657"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11413","display_name":"Risk and Portfolio Optimization","score":0.9979000091552734,"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"}},"topics":[{"id":"https://openalex.org/T11413","display_name":"Risk and Portfolio Optimization","score":0.9979000091552734,"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"}},{"id":"https://openalex.org/T10969","display_name":"Water resources management and optimization","score":0.9969000220298767,"subfield":{"id":"https://openalex.org/subfields/2212","display_name":"Ocean 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/T10424","display_name":"Electric Power System Optimization","score":0.9879000186920166,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic 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/benders-decomposition","display_name":"Benders' decomposition","score":0.8088122606277466},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7239333391189575},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6950037479400635},{"id":"https://openalex.org/keywords/verifiable-secret-sharing","display_name":"Verifiable secret sharing","score":0.6417592167854309},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.6124660968780518},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.5774502158164978},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5651969909667969},{"id":"https://openalex.org/keywords/stochastic-programming","display_name":"Stochastic programming","score":0.5637542009353638},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.44874638319015503},{"id":"https://openalex.org/keywords/dual","display_name":"Dual (grammatical number)","score":0.42116305232048035},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.21597325801849365}],"concepts":[{"id":"https://openalex.org/C27665512","wikidata":"https://www.wikidata.org/wiki/Q3042795","display_name":"Benders' decomposition","level":2,"score":0.8088122606277466},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7239333391189575},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6950037479400635},{"id":"https://openalex.org/C85847156","wikidata":"https://www.wikidata.org/wiki/Q59015987","display_name":"Verifiable secret sharing","level":3,"score":0.6417592167854309},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.6124660968780518},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.5774502158164978},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5651969909667969},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.5637542009353638},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.44874638319015503},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.42116305232048035},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.21597325801849365},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","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/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","level":0,"score":0.0},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"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/C124952713","wikidata":"https://www.wikidata.org/wiki/Q8242","display_name":"Literature","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/s1052623497318700","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s1052623497318700","pdf_url":null,"source":{"id":"https://openalex.org/S928796702","display_name":"SIAM Journal on Optimization","issn_l":"1052-6234","issn":["1052-6234","1095-7189"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Optimization","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1587458453","https://openalex.org/W1968077632","https://openalex.org/W1970676206","https://openalex.org/W1980331059","https://openalex.org/W1983743030","https://openalex.org/W2012437081","https://openalex.org/W2018682725","https://openalex.org/W2038426159","https://openalex.org/W2044121814","https://openalex.org/W2061962896","https://openalex.org/W2069808690","https://openalex.org/W2072677159","https://openalex.org/W2072867904","https://openalex.org/W2082155171","https://openalex.org/W2105560970","https://openalex.org/W3106992008","https://openalex.org/W4237512656","https://openalex.org/W4241470852"],"related_works":["https://openalex.org/W2382905498","https://openalex.org/W1585941908","https://openalex.org/W14353188","https://openalex.org/W3022460320","https://openalex.org/W2029226820","https://openalex.org/W3108931812","https://openalex.org/W4291002219","https://openalex.org/W2077378876","https://openalex.org/W2062485877","https://openalex.org/W2743844154"],"abstract_inverted_index":{"Benders":[0,36],"decomposition":[1,37,81],"is":[2,18,85],"a":[3,12,19,78,96],"well-known":[4],"technique":[5,21],"for":[6,22],"solving":[7,23],"large":[8],"linear":[9,26],"programs":[10],"with":[11,87],"special":[13],"structure.":[14],"In":[15],"particular,":[16],"it":[17],"popular":[20],"multistage":[24],"stochastic":[25,99],"programming":[27,100],"problems.":[28],"Early":[29],"termination":[30],"in":[31,47,104],"the":[32,48,93],"subproblems":[33],"generated":[34],"during":[35],"(assuming":[38],"dual":[39],"feasibility)":[40],"produces":[41],"valid":[42],"cuts":[43,57],"that":[44,50,102],"are":[45,52],"inexact":[46,66],"sense":[49],"they":[51],"not":[53],"as":[54,56],"constraining":[55],"derived":[58],"from":[59,91],"an":[60,65],"exact":[61],"solution.":[62],"We":[63],"describe":[64],"cut":[67],"algorithm,":[68],"prove":[69],"its":[70],"convergence":[71],"under":[72],"easily":[73],"verifiable":[74],"assumptions,":[75],"and":[76],"discuss":[77],"corresponding":[79],"Dantzig--Wolfe":[80],"algorithm.":[82],"The":[83],"paper":[84],"concluded":[86],"some":[88],"computational":[89],"results":[90],"applying":[92],"algorithm":[94],"to":[95],"class":[97],"of":[98],"problems":[101],"arise":[103],"hydroelectric":[105],"scheduling.":[106]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":7},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":7},{"year":2019,"cited_by_count":9},{"year":2018,"cited_by_count":8},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":10},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":6}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}