{"id":"https://openalex.org/W2042478958","doi":"https://doi.org/10.1016/s0377-2217(97)00034-9","title":"Efficient cuts in Lagrangean \u2018Relax-and-cut\u2019 schemes","display_name":"Efficient cuts in Lagrangean \u2018Relax-and-cut\u2019 schemes","publication_year":1998,"publication_date":"1998-02-01","ids":{"openalex":"https://openalex.org/W2042478958","doi":"https://doi.org/10.1016/s0377-2217(97)00034-9","mag":"2042478958"},"language":"en","primary_location":{"id":"doi:10.1016/s0377-2217(97)00034-9","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s0377-2217(97)00034-9","pdf_url":null,"source":{"id":"https://openalex.org/S103321696","display_name":"European Journal of Operational Research","issn_l":"0377-2217","issn":["0377-2217","1872-6860"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"European Journal of Operational Research","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://doi.org/10.1016/s0377-2217(97)00034-9","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5021321550","display_name":"Monique Guignard","orcid":"https://orcid.org/0000-0003-4084-434X"},"institutions":[{"id":"https://openalex.org/I79576946","display_name":"University of Pennsylvania","ror":"https://ror.org/00b30xv10","country_code":"US","type":"education","lineage":["https://openalex.org/I79576946"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Monique Guignard","raw_affiliation_strings":["Department of OPIM, The Wharton School, University of Pennsylvania, Philadelphia, PA 19104-6366, USA"],"affiliations":[{"raw_affiliation_string":"Department of OPIM, The Wharton School, University of Pennsylvania, Philadelphia, PA 19104-6366, USA","institution_ids":["https://openalex.org/I79576946"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5021321550"],"corresponding_institution_ids":["https://openalex.org/I79576946"],"apc_list":{"value":3290,"currency":"USD","value_usd":3290},"apc_paid":{"value":3290,"currency":"USD","value_usd":3290},"fwci":0.9316,"has_fulltext":false,"cited_by_count":27,"citation_normalized_percentile":{"value":0.75098988,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"105","issue":"1","first_page":"216","last_page":"223"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9993000030517578,"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.9993000030517578,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9984999895095825,"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/T10545","display_name":"Optimization and Variational Analysis","score":0.996999979019165,"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/integer-programming","display_name":"Integer programming","score":0.7590745687484741},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7147549986839294},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.692131519317627},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6779699325561523},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.6635724902153015},{"id":"https://openalex.org/keywords/bracketing","display_name":"Bracketing (phenomenology)","score":0.6270158290863037},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.5702481269836426},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5136210322380066},{"id":"https://openalex.org/keywords/interval","display_name":"Interval (graph theory)","score":0.48185810446739197},{"id":"https://openalex.org/keywords/value","display_name":"Value (mathematics)","score":0.4760967493057251},{"id":"https://openalex.org/keywords/residual","display_name":"Residual","score":0.4704540967941284},{"id":"https://openalex.org/keywords/branch-and-cut","display_name":"Branch and cut","score":0.4405115842819214},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.24704265594482422},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.22209420800209045},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.21293586492538452},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.0744328498840332}],"concepts":[{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.7590745687484741},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7147549986839294},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.692131519317627},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6779699325561523},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.6635724902153015},{"id":"https://openalex.org/C102944935","wikidata":"https://www.wikidata.org/wiki/Q4953701","display_name":"Bracketing (phenomenology)","level":2,"score":0.6270158290863037},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.5702481269836426},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5136210322380066},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.48185810446739197},{"id":"https://openalex.org/C2776291640","wikidata":"https://www.wikidata.org/wiki/Q2912517","display_name":"Value (mathematics)","level":2,"score":0.4760967493057251},{"id":"https://openalex.org/C155512373","wikidata":"https://www.wikidata.org/wiki/Q287450","display_name":"Residual","level":2,"score":0.4704540967941284},{"id":"https://openalex.org/C50797617","wikidata":"https://www.wikidata.org/wiki/Q498566","display_name":"Branch and cut","level":3,"score":0.4405115842819214},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.24704265594482422},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.22209420800209045},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.21293586492538452},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0744328498840332},{"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"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/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"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/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1016/s0377-2217(97)00034-9","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s0377-2217(97)00034-9","pdf_url":null,"source":{"id":"https://openalex.org/S103321696","display_name":"European Journal of Operational Research","issn_l":"0377-2217","issn":["0377-2217","1872-6860"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"European Journal of Operational Research","raw_type":"journal-article"},{"id":"pmh:oai:RePEc:eee:ejores:v:105:y:1998:i:1:p:216-223","is_oa":false,"landing_page_url":"http://www.sciencedirect.com/science/article/pii/S0377-2217(97)00034-9","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":{"id":"doi:10.1016/s0377-2217(97)00034-9","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s0377-2217(97)00034-9","pdf_url":null,"source":{"id":"https://openalex.org/S103321696","display_name":"European Journal of Operational Research","issn_l":"0377-2217","issn":["0377-2217","1872-6860"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"European Journal of Operational Research","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1496039454","https://openalex.org/W1530075571","https://openalex.org/W1978038344","https://openalex.org/W1995203453","https://openalex.org/W2015411837","https://openalex.org/W2020030076","https://openalex.org/W2022065551","https://openalex.org/W2147336456","https://openalex.org/W3164660163","https://openalex.org/W4242130683","https://openalex.org/W6629381804","https://openalex.org/W6796105954"],"related_works":["https://openalex.org/W2009796757","https://openalex.org/W4252122881","https://openalex.org/W2769220156","https://openalex.org/W134055995","https://openalex.org/W4302819359","https://openalex.org/W4210880521","https://openalex.org/W1981350060","https://openalex.org/W58208513","https://openalex.org/W2769538987","https://openalex.org/W4300803591"],"abstract_inverted_index":{"Lagrangean":[0,58,74,91],"relaxation":[1,92],"produces":[2],"bounds":[3],"on":[4],"the":[5,24,28,32,36,40,46,57,72,90],"optimal":[6,25],"value":[7,26],"of":[8,27,39,65,112],"(mixed)":[9,117],"integer":[10,17,118],"programming":[11,119],"problems.":[12,120],"These":[13],"bounds,":[14],"together":[15],"with":[16],"feasible":[18],"solution":[19],"values,":[20],"provide":[21],"intervals":[22],"bracketing":[23],"original":[29],"problem.":[30],"When":[31],"residual":[33],"gap,":[34],"i.e.,":[35],"relative":[37],"size":[38],"interval,":[41],"is":[42,53,85],"too":[43],"large":[44],"for":[45,115],"approximations":[47],"to":[48,55],"be":[49],"deemed":[50],"satisfactory,":[51],"it":[52],"desirable":[54],"\u2018strengthen\u2019":[56],"bounds.":[59,107],"One":[60],"possible":[61],"strengthening":[62],"technique":[63],"consists":[64],"identifying":[66],"cuts":[67,114],"which":[68],"are":[69],"violated":[70,87,102],"by":[71],"current":[73],"solution,":[75],"and":[76],"dualizing":[77],"them.":[78],"Unfortunately":[79],"not":[80],"every":[81],"valid":[82],"inequality":[83],"that":[84],"currently":[86],"will":[88],"improve":[89],"bound":[93],"when":[94],"dualized.":[95],"This":[96],"paper":[97],"investigates":[98],"what":[99],"makes":[100],"a":[101],"cut":[103],"\u2018efficient\u2019":[104],"in":[105],"improving":[106],"It":[108],"also":[109],"provides":[110],"examples":[111],"efficient":[113],"several":[116]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}