{"id":"https://openalex.org/W2139337114","doi":"https://doi.org/10.1017/s0269888901000030","title":"Branch-and-cut for combinatorial optimization problems without auxiliary binary variables","display_name":"Branch-and-cut for combinatorial optimization problems without auxiliary binary variables","publication_year":2001,"publication_date":"2001-03-01","ids":{"openalex":"https://openalex.org/W2139337114","doi":"https://doi.org/10.1017/s0269888901000030","mag":"2139337114"},"language":"en","primary_location":{"id":"doi:10.1017/s0269888901000030","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0269888901000030","pdf_url":null,"source":{"id":"https://openalex.org/S137506714","display_name":"The Knowledge Engineering Review","issn_l":"0269-8889","issn":["0269-8889","1469-8005"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Knowledge Engineering Review","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/A5111946926","display_name":"I.R. de Farias","orcid":null},"institutions":[{"id":"https://openalex.org/I63190737","display_name":"University at Buffalo, State University of New York","ror":"https://ror.org/01y64my43","country_code":"US","type":"education","lineage":["https://openalex.org/I63190737"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"I. R. DE FARIAS","raw_affiliation_strings":["State University of New York at Buffalo, 403 Bell Hall, Buffalo, NY 14260-2050, USA"],"affiliations":[{"raw_affiliation_string":"State University of New York at Buffalo, 403 Bell Hall, Buffalo, NY 14260-2050, USA","institution_ids":["https://openalex.org/I63190737"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5110102325","display_name":"E. L. Johnson","orcid":null},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"E. L. JOHNSON","raw_affiliation_strings":["School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, GA 30332-0205, USA","School of Industrial and Systems Engineering Georgia Institute of Technology Atlanta, GA 30332-0205 USA"],"affiliations":[{"raw_affiliation_string":"School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, GA 30332-0205, USA","institution_ids":["https://openalex.org/I130701444"]},{"raw_affiliation_string":"School of Industrial and Systems Engineering Georgia Institute of Technology Atlanta, GA 30332-0205 USA","institution_ids":["https://openalex.org/I130701444"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5057281816","display_name":"George L. Nemhauser","orcid":null},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"G. L. NEMHAUSER","raw_affiliation_strings":["School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, GA 30332-0205, USA","School of Industrial and Systems Engineering Georgia Institute of Technology Atlanta, GA 30332-0205 USA"],"affiliations":[{"raw_affiliation_string":"School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, GA 30332-0205, USA","institution_ids":["https://openalex.org/I130701444"]},{"raw_affiliation_string":"School of Industrial and Systems Engineering Georgia Institute of Technology Atlanta, GA 30332-0205 USA","institution_ids":["https://openalex.org/I130701444"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5111946926"],"corresponding_institution_ids":["https://openalex.org/I63190737"],"apc_list":null,"apc_paid":null,"fwci":4.3562,"has_fulltext":false,"cited_by_count":52,"citation_normalized_percentile":{"value":0.95168685,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"16","issue":"1","first_page":"25","last_page":"39"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9980999827384949,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9973000288009644,"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/integer-programming","display_name":"Integer programming","score":0.7096428275108337},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.7031701803207397},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6190539598464966},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.6094478964805603},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.5774011015892029},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5421910881996155},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.539717972278595},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.4939597249031067},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.44668397307395935},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.44328880310058594},{"id":"https://openalex.org/keywords/variable","display_name":"Variable (mathematics)","score":0.4314326047897339},{"id":"https://openalex.org/keywords/branch-and-cut","display_name":"Branch and cut","score":0.42880070209503174},{"id":"https://openalex.org/keywords/stochastic-programming","display_name":"Stochastic programming","score":0.18041545152664185}],"concepts":[{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.7096428275108337},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.7031701803207397},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6190539598464966},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.6094478964805603},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.5774011015892029},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5421910881996155},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.539717972278595},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.4939597249031067},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.44668397307395935},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.44328880310058594},{"id":"https://openalex.org/C182365436","wikidata":"https://www.wikidata.org/wiki/Q50701","display_name":"Variable (mathematics)","level":2,"score":0.4314326047897339},{"id":"https://openalex.org/C50797617","wikidata":"https://www.wikidata.org/wiki/Q498566","display_name":"Branch and cut","level":3,"score":0.42880070209503174},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.18041545152664185},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","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}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1017/s0269888901000030","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0269888901000030","pdf_url":null,"source":{"id":"https://openalex.org/S137506714","display_name":"The Knowledge Engineering Review","issn_l":"0269-8889","issn":["0269-8889","1469-8005"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Knowledge Engineering Review","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.131.7135","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.131.7135","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.eng.buffalo.edu/~defarias/journal/paper5.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W1577278402","https://openalex.org/W1922855725","https://openalex.org/W1965226070","https://openalex.org/W2005305324","https://openalex.org/W2009683816","https://openalex.org/W2011130308","https://openalex.org/W2020386027","https://openalex.org/W2021895358","https://openalex.org/W2021947147","https://openalex.org/W2026994686","https://openalex.org/W2038095021","https://openalex.org/W2040713795","https://openalex.org/W2045373948","https://openalex.org/W2046076510","https://openalex.org/W2053234120","https://openalex.org/W2059215096","https://openalex.org/W2088741806","https://openalex.org/W2099103397","https://openalex.org/W2134094348","https://openalex.org/W2146592084","https://openalex.org/W2166029977","https://openalex.org/W2167539320","https://openalex.org/W2292467163","https://openalex.org/W2336259629","https://openalex.org/W3139666781"],"related_works":["https://openalex.org/W2761798304","https://openalex.org/W2734758384","https://openalex.org/W2055782437","https://openalex.org/W2990947859","https://openalex.org/W1971625902","https://openalex.org/W2989854141","https://openalex.org/W2026025906","https://openalex.org/W2067331283","https://openalex.org/W2165765741","https://openalex.org/W2139337114"],"abstract_inverted_index":{"Many":[0],"optimisation":[1],"problems":[2,37,89],"involve":[3],"combinatorial":[4,13,63,94,119],"constraints":[5,58,120,138],"on":[6],"continuous":[7],"variables.":[8,126],"An":[9],"example":[10],"of":[11,24,55,124,131,162],"a":[12,22,113,153],"constraint":[14,84],"is":[15,65],"that":[16,116,157],"at":[17],"most":[18],"one":[19],"variable":[20],"in":[21,31,103,159],"group":[23],"nonnegative":[25],"variables":[26,48,56],"may":[27,74],"be":[28,76,140],"positive.":[29],"Traditionally,":[30,83],"the":[32,53,62,93,104,118,122,129,149,160],"mathematical":[33],"programming":[34,72,85,101],"community,":[35],"such":[36,88],"have":[38],"been":[39],"modeled":[40],"as":[41],"mixed-integer":[42,71],"programs":[43],"by":[44],"introducing":[45],"auxiliary":[46],"binary":[47,125],"and":[49,57,61,91,134],"additional":[50],"constraints.":[51],"Because":[52],"number":[54],"becomes":[59],"larger":[60],"structure":[64],"not":[66,75,98],"used":[67],"to":[68,87],"advantage,":[69],"these":[70],"models":[73],"solved":[77],"satisfactorily,":[78],"except":[79],"for":[80,106],"small":[81],"instances.":[82],"approaches":[86],"keep":[90],"use":[92,99],"structure,":[95],"but":[96],"do":[97],"linear":[100],"bounds":[102],"search":[105],"an":[107],"optimal":[108],"solution.":[109],"Here":[110],"we":[111,151],"present":[112,152],"branch-and-cut":[114],"approach":[115,133],"considers":[117],"without":[121],"introduction":[123],"We":[127],"review":[128],"development":[130],"this":[132],"show":[135],"how":[136],"strong":[137],"can":[139],"derived":[141],"using":[142],"ideas":[143],"from":[144],"polyhedral":[145],"combinatorics.":[146],"To":[147],"illustrate":[148],"ideas,":[150],"production":[154],"scheduling":[155],"model":[156],"arises":[158],"manufacture":[161],"fibre":[163],"optic":[164],"cables.":[165]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":4},{"year":2022,"cited_by_count":3},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":3},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":3}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}