{"id":"https://openalex.org/W2064806410","doi":"https://doi.org/10.1287/ijoc.8.3.219","title":"Experience with a Cutting Plane Algorithm for the Capacitated Spanning Tree Problem","display_name":"Experience with a Cutting Plane Algorithm for the Capacitated Spanning Tree Problem","publication_year":1996,"publication_date":"1996-08-01","ids":{"openalex":"https://openalex.org/W2064806410","doi":"https://doi.org/10.1287/ijoc.8.3.219","mag":"2064806410"},"language":"en","primary_location":{"id":"doi:10.1287/ijoc.8.3.219","is_oa":false,"landing_page_url":"https://doi.org/10.1287/ijoc.8.3.219","pdf_url":null,"source":{"id":"https://openalex.org/S165318533","display_name":"INFORMS journal on computing","issn_l":"1091-9856","issn":["1091-9856","1526-5528"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315699","host_organization_name":"Institute for Operations Research and the Management Sciences","host_organization_lineage":["https://openalex.org/P4310315699"],"host_organization_lineage_names":["Institute for Operations Research and the Management Sciences"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"INFORMS Journal on Computing","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/A5068648608","display_name":"L. A. Hall","orcid":null},"institutions":[{"id":"https://openalex.org/I145311948","display_name":"Johns Hopkins University","ror":"https://ror.org/00za53h95","country_code":"US","type":"education","lineage":["https://openalex.org/I145311948"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Leslie Hall","raw_affiliation_strings":["Department of Mathematical Sciences, The Johns Hopkins University, Baltimore, MD 21218"],"affiliations":[{"raw_affiliation_string":"Department of Mathematical Sciences, The Johns Hopkins University, Baltimore, MD 21218","institution_ids":["https://openalex.org/I145311948"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5068648608"],"corresponding_institution_ids":["https://openalex.org/I145311948"],"apc_list":null,"apc_paid":null,"fwci":10.4642,"has_fulltext":false,"cited_by_count":62,"citation_normalized_percentile":{"value":0.98517979,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"8","issue":"3","first_page":"219","last_page":"234"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9995999932289124,"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"}},"topics":[{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9995999932289124,"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.9959999918937683,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9757000207901001,"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/computer-science","display_name":"Computer science","score":0.6214159727096558},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.6176808476448059},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6120456457138062},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.5800842046737671},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.574479877948761},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5617356300354004},{"id":"https://openalex.org/keywords/focus","display_name":"Focus (optics)","score":0.5351586937904358},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.5137394666671753},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5056581497192383},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.48237767815589905},{"id":"https://openalex.org/keywords/cutting-plane-method","display_name":"Cutting-plane method","score":0.46201884746551514},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.4263918101787567},{"id":"https://openalex.org/keywords/vehicle-routing-problem","display_name":"Vehicle routing problem","score":0.42453593015670776},{"id":"https://openalex.org/keywords/plane","display_name":"Plane (geometry)","score":0.4187540113925934},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3587053418159485},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.32141029834747314},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3015934228897095},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.25438976287841797},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.10969504714012146},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.08317077159881592},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.07886624336242676}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6214159727096558},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.6176808476448059},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6120456457138062},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.5800842046737671},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.574479877948761},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5617356300354004},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.5351586937904358},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.5137394666671753},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5056581497192383},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.48237767815589905},{"id":"https://openalex.org/C109839438","wikidata":"https://www.wikidata.org/wiki/Q1762039","display_name":"Cutting-plane method","level":3,"score":0.46201884746551514},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.4263918101787567},{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.42453593015670776},{"id":"https://openalex.org/C17825722","wikidata":"https://www.wikidata.org/wiki/Q17285","display_name":"Plane (geometry)","level":2,"score":0.4187540113925934},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3587053418159485},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.32141029834747314},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3015934228897095},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.25438976287841797},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.10969504714012146},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.08317077159881592},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.07886624336242676},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C120665830","wikidata":"https://www.wikidata.org/wiki/Q14620","display_name":"Optics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1287/ijoc.8.3.219","is_oa":false,"landing_page_url":"https://doi.org/10.1287/ijoc.8.3.219","pdf_url":null,"source":{"id":"https://openalex.org/S165318533","display_name":"INFORMS journal on computing","issn_l":"1091-9856","issn":["1091-9856","1526-5528"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315699","host_organization_name":"Institute for Operations Research and the Management Sciences","host_organization_lineage":["https://openalex.org/P4310315699"],"host_organization_lineage_names":["Institute for Operations Research and the Management Sciences"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"INFORMS Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:RePEc:inm:orijoc:v:8:y:1996:i:3:p:219-234","is_oa":false,"landing_page_url":"http://doi.org/10.1287/ijoc.8.3.219","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":"","raw_type":"article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W1484547884","https://openalex.org/W1559705156","https://openalex.org/W1606779053","https://openalex.org/W1963574949","https://openalex.org/W1964705035","https://openalex.org/W1966951324","https://openalex.org/W1998205685","https://openalex.org/W2012682597","https://openalex.org/W2017127755","https://openalex.org/W2019401519","https://openalex.org/W2027278505","https://openalex.org/W2029242918","https://openalex.org/W2049967755","https://openalex.org/W2052862856","https://openalex.org/W2069318500","https://openalex.org/W2103818573","https://openalex.org/W2104431850","https://openalex.org/W2106627221","https://openalex.org/W2114045721","https://openalex.org/W2114552889","https://openalex.org/W2118769536","https://openalex.org/W2124540286","https://openalex.org/W2134092250","https://openalex.org/W2139582537","https://openalex.org/W2141018803","https://openalex.org/W2152413298","https://openalex.org/W2163428398","https://openalex.org/W2167539320","https://openalex.org/W2795679194"],"related_works":["https://openalex.org/W3211968237","https://openalex.org/W4232603692","https://openalex.org/W1873446655","https://openalex.org/W2347559954","https://openalex.org/W2353969743","https://openalex.org/W114880096","https://openalex.org/W2142927985","https://openalex.org/W2183524462","https://openalex.org/W1989698351","https://openalex.org/W2285922459"],"abstract_inverted_index":{"A":[0],"basic":[1],"problem":[2],"in":[3],"telecommunications":[4],"network":[5,18],"design":[6],"is":[7,45],"that":[8,23,35],"of":[9,42,59,62,65,75,85,89,128,154],"designing":[10],"a":[11,17,20,28,51,101,126,152],"capacitated":[12,115],"centralized":[13],"processing":[14],"network.":[15],"Such":[16],"has":[19,77],"central":[21],"processor":[22],"must":[24],"be":[25],"linked":[26],"via":[27],"tree":[29,117],"topology":[30],"to":[31,47,72,132],"several":[32],"remote":[33],"terminals":[34],"have":[36,48],"specified":[37],"demands.":[38],"Each":[39],"subtree":[40],"off":[41],"the":[43,57,60,63,66,97,109,114,138,159],"root":[44],"constrained":[46],"at":[49],"most":[50],"fixed,":[52],"limited":[53],"demand,":[54],"represented":[55],"by":[56],"sum":[58],"demands":[61],"nodes":[64],"subtree.":[67],"Finding":[68],"provably":[69],"optimal":[70],"solutions":[71],"this":[73],"class":[74],"problems":[76],"been":[78],"surprisingly":[79],"difficult,":[80],"particularly":[81],"for":[82,96,119],"certain":[83],"types":[84],"instances":[86,129],"and":[87,141],"choices":[88],"parameters.":[90],"This":[91],"paper":[92],"presents":[93],"computational":[94,123],"results":[95],"problem,":[98,118],"based":[99],"on":[100,108,125,143,151],"cutting":[102,148],"plane":[103,149],"algorithm.":[104],"We":[105,135],"first":[106],"focus":[107],"unit-demand":[110],"case,":[111],"known":[112],"as":[113,145,147],"spanning":[116],"which":[120],"we":[121],"present":[122],"experience":[124],"range":[127,153],"with":[130],"up":[131],"200":[133],"nodes.":[134],"then":[136],"consider":[137],"general-demand":[139],"case":[140],"report":[142],"branch-and-cut":[144],"well":[146],"computations":[150],"instances,":[155],"including":[156],"some":[157],"from":[158],"vehicle":[160],"routing":[161],"literature.":[162]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}