{"id":"https://openalex.org/W2168539132","doi":"https://doi.org/10.1051/ro:2006010","title":"Branch and Cut based on the volume algorithm: Steiner trees in graphs and Max-cut","display_name":"Branch and Cut based on the volume algorithm: Steiner trees in graphs and Max-cut","publication_year":2006,"publication_date":"2006-01-01","ids":{"openalex":"https://openalex.org/W2168539132","doi":"https://doi.org/10.1051/ro:2006010","mag":"2168539132"},"language":"en","primary_location":{"id":"doi:10.1051/ro:2006010","is_oa":false,"landing_page_url":"https://doi.org/10.1051/ro:2006010","pdf_url":null,"source":{"id":"https://openalex.org/S20631277","display_name":"RAIRO - Operations Research","issn_l":"0399-0559","issn":["0399-0559","1290-3868"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319748","host_organization_name":"EDP Sciences","host_organization_lineage":["https://openalex.org/P4310319748"],"host_organization_lineage_names":["EDP Sciences"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"RAIRO - Operations Research","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://www.numdam.org/item/10.1051/ro:2006010.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5076877502","display_name":"Francisco Barahona","orcid":"https://orcid.org/0000-0002-4829-7515"},"institutions":[{"id":"https://openalex.org/I1341412227","display_name":"IBM (United States)","ror":"https://ror.org/05hh8d621","country_code":"US","type":"company","lineage":["https://openalex.org/I1341412227"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Francisco Barahona","raw_affiliation_strings":["IBM T. J. Watson research Center, Yorktown Heights, NY 10589, USA; barahon@us.ibm.com; ladanyi@us.ibm.com","IBM T. J. Watson research Center, Yorktown Heights, NY 10589, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IBM T. J. Watson research Center, Yorktown Heights, NY 10589, USA; barahon@us.ibm.com; ladanyi@us.ibm.com","institution_ids":["https://openalex.org/I1341412227"]},{"raw_affiliation_string":"IBM T. J. Watson research Center, Yorktown Heights, NY 10589, USA","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5057888495","display_name":"L. Lad\u00e1nyi","orcid":null},"institutions":[{"id":"https://openalex.org/I1341412227","display_name":"IBM (United States)","ror":"https://ror.org/05hh8d621","country_code":"US","type":"company","lineage":["https://openalex.org/I1341412227"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"L\u00e1szl\u00f3 Lad\u00e1nyi","raw_affiliation_strings":["IBM T. J. Watson research Center, Yorktown Heights, NY 10589, USA; barahon@us.ibm.com; ladanyi@us.ibm.com","IBM T. J. Watson research Center, Yorktown Heights, NY 10589, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IBM T. J. Watson research Center, Yorktown Heights, NY 10589, USA; barahon@us.ibm.com; ladanyi@us.ibm.com","institution_ids":["https://openalex.org/I1341412227"]},{"raw_affiliation_string":"IBM T. J. Watson research Center, Yorktown Heights, NY 10589, USA","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.3314,"has_fulltext":true,"cited_by_count":22,"citation_normalized_percentile":{"value":0.89980944,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"40","issue":"1","first_page":"53","last_page":"73"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9896000027656555,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9896000027656555,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.988099992275238,"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/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.9861000180244446,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/steiner-tree-problem","display_name":"Steiner tree problem","score":0.8644301891326904},{"id":"https://openalex.org/keywords/branch-and-cut","display_name":"Branch and cut","score":0.7144436240196228},{"id":"https://openalex.org/keywords/maximum-cut","display_name":"Maximum cut","score":0.7057242393493652},{"id":"https://openalex.org/keywords/simplex-algorithm","display_name":"Simplex algorithm","score":0.6486420035362244},{"id":"https://openalex.org/keywords/simplex","display_name":"Simplex","score":0.5774174332618713},{"id":"https://openalex.org/keywords/volume","display_name":"Volume (thermodynamics)","score":0.5464878678321838},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5434039831161499},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5269273519515991},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.48975038528442383},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.4305551052093506},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4155254662036896},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4094264805316925},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3585467040538788},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.34394294023513794},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.11843934655189514}],"concepts":[{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.8644301891326904},{"id":"https://openalex.org/C50797617","wikidata":"https://www.wikidata.org/wiki/Q498566","display_name":"Branch and cut","level":3,"score":0.7144436240196228},{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.7057242393493652},{"id":"https://openalex.org/C144521790","wikidata":"https://www.wikidata.org/wiki/Q134164","display_name":"Simplex algorithm","level":3,"score":0.6486420035362244},{"id":"https://openalex.org/C62438384","wikidata":"https://www.wikidata.org/wiki/Q331350","display_name":"Simplex","level":2,"score":0.5774174332618713},{"id":"https://openalex.org/C20556612","wikidata":"https://www.wikidata.org/wiki/Q4469374","display_name":"Volume (thermodynamics)","level":2,"score":0.5464878678321838},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5434039831161499},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5269273519515991},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.48975038528442383},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.4305551052093506},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4155254662036896},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4094264805316925},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3585467040538788},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.34394294023513794},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.11843934655189514},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1051/ro:2006010","is_oa":false,"landing_page_url":"https://doi.org/10.1051/ro:2006010","pdf_url":null,"source":{"id":"https://openalex.org/S20631277","display_name":"RAIRO - Operations Research","issn_l":"0399-0559","issn":["0399-0559","1290-3868"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319748","host_organization_name":"EDP Sciences","host_organization_lineage":["https://openalex.org/P4310319748"],"host_organization_lineage_names":["EDP Sciences"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"RAIRO - Operations Research","raw_type":"journal-article"},{"id":"pmh:oai:numdam.org:RO_2006__40_1_53_0","is_oa":true,"landing_page_url":"http://www.numdam.org/articles/10.1051/ro:2006010/","pdf_url":"https://www.numdam.org/item/10.1051/ro:2006010.pdf","source":{"id":"https://openalex.org/S4306402264","display_name":"French digital mathematics library (Numdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I70900168","host_organization_name":"Universit\u00e9 Savoie Mont Blanc","host_organization_lineage":["https://openalex.org/I70900168"],"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":"Text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.679.3787","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.679.3787","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.optimization-online.org/DB_FILE/2001/12/420.pdf","raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:numdam.org:RO_2006__40_1_53_0","is_oa":true,"landing_page_url":"http://www.numdam.org/articles/10.1051/ro:2006010/","pdf_url":"https://www.numdam.org/item/10.1051/ro:2006010.pdf","source":{"id":"https://openalex.org/S4306402264","display_name":"French digital mathematics library (Numdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I70900168","host_organization_name":"Universit\u00e9 Savoie Mont Blanc","host_organization_lineage":["https://openalex.org/I70900168"],"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":"Text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2168539132.pdf","grobid_xml":"https://content.openalex.org/works/W2168539132.grobid-xml"},"referenced_works_count":33,"referenced_works":["https://openalex.org/W71437166","https://openalex.org/W149430354","https://openalex.org/W171715212","https://openalex.org/W201222650","https://openalex.org/W291625388","https://openalex.org/W941495419","https://openalex.org/W1852828099","https://openalex.org/W1983479437","https://openalex.org/W1989947834","https://openalex.org/W2007503572","https://openalex.org/W2008534472","https://openalex.org/W2008571296","https://openalex.org/W2009803313","https://openalex.org/W2012605254","https://openalex.org/W2015411837","https://openalex.org/W2017697298","https://openalex.org/W2029242918","https://openalex.org/W2031978868","https://openalex.org/W2035903877","https://openalex.org/W2039706936","https://openalex.org/W2042478958","https://openalex.org/W2050014122","https://openalex.org/W2058748455","https://openalex.org/W2065007370","https://openalex.org/W2078979423","https://openalex.org/W2090246427","https://openalex.org/W2119918317","https://openalex.org/W2155239253","https://openalex.org/W2159739530","https://openalex.org/W2164245156","https://openalex.org/W2170923533","https://openalex.org/W4246185962","https://openalex.org/W6836072559"],"related_works":["https://openalex.org/W1965005420","https://openalex.org/W2501873806","https://openalex.org/W4385791789","https://openalex.org/W2072929135","https://openalex.org/W2385011829","https://openalex.org/W3181368311","https://openalex.org/W2022674418","https://openalex.org/W4242582913","https://openalex.org/W2168539132","https://openalex.org/W1982719520"],"abstract_inverted_index":{"We":[0,50,61,86],"present":[1,51],"a":[2,81],"Branch-and-Cut":[3,77],"algorithm":[4,8,18,75],"where":[5],"the":[6,13,20,25,29,55,73,89,98],"volume":[7,74,90],"is":[9],"applied":[10],"instead":[11,44],"of":[12,28,45],"traditionally":[14],"used":[15],"dual":[16,82],"simplex":[17,83,99],"to":[19,40],"linear":[21,42],"programming":[22],"relaxations":[23],"in":[24],"root":[26],"node":[27],"search":[30],"tree.":[31],"This":[32],"means":[33],"that":[34,64],"we":[35],"use":[36],"fast":[37],"approximate":[38],"solutions":[39],"these":[41,68],"programs":[43],"exact":[46],"but":[47],"slower":[48],"solutions.":[49],"computational":[52],"results":[53],"with":[54,72,80],"Steiner":[56],"tree":[57],"and":[58],"Max-Cut":[59],"problems.":[60],"show":[62],"evidence":[63],"one":[65],"can":[66],"solve":[67],"problems":[69],"much":[70],"faster":[71],"based":[76,84,91,100],"code":[78],"than":[79,97],"one.":[85],"discuss":[87],"when":[88],"approach":[92],"might":[93],"be":[94],"more":[95],"efficient":[96],"approach.":[101]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2018,"cited_by_count":3},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}