{"id":"https://openalex.org/W2059690430","doi":"https://doi.org/10.1002/net.10069","title":"Network flow models for designing diameter\u2010constrained minimum\u2010spanning and Steiner trees","display_name":"Network flow models for designing diameter\u2010constrained minimum\u2010spanning and Steiner trees","publication_year":2003,"publication_date":"2003-03-24","ids":{"openalex":"https://openalex.org/W2059690430","doi":"https://doi.org/10.1002/net.10069","mag":"2059690430"},"language":"en","primary_location":{"id":"doi:10.1002/net.10069","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.10069","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://hdl.handle.net/1721.1/5310","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5017238021","display_name":"Lu\u0131\u0301s Gouveia","orcid":"https://orcid.org/0000-0003-4393-1617"},"institutions":[{"id":"https://openalex.org/I141596103","display_name":"University of Lisbon","ror":"https://ror.org/01c27hj86","country_code":"PT","type":"education","lineage":["https://openalex.org/I141596103"]}],"countries":["PT"],"is_corresponding":true,"raw_author_name":"Luis Gouveia","raw_affiliation_strings":["DEIO-CIO, Faculdade de Cie\u0302ncias da Universidade de Lisboa, Bloco C/2\u2013Campo Grande, Cidade Universitaria, 1700 Lisbon, Portugal","DEIO\u2010CIO, Faculdade de Ci\u00eancias da Universidade de Lisboa, Bloco C/2\u2013Campo Grande, Cidade Universitaria, 1700 Lisbon, Portugal"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"DEIO-CIO, Faculdade de Cie\u0302ncias da Universidade de Lisboa, Bloco C/2\u2013Campo Grande, Cidade Universitaria, 1700 Lisbon, Portugal","institution_ids":["https://openalex.org/I141596103"]},{"raw_affiliation_string":"DEIO\u2010CIO, Faculdade de Ci\u00eancias da Universidade de Lisboa, Bloco C/2\u2013Campo Grande, Cidade Universitaria, 1700 Lisbon, Portugal","institution_ids":["https://openalex.org/I141596103"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5023919615","display_name":"Thomas L. Magnanti","orcid":"https://orcid.org/0000-0002-0771-3850"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Thomas L. Magnanti","raw_affiliation_strings":["Department of Electrical Engineering and Computer Science and Sloan School of Management, MIT, Cambridge, Massachusetts 02139"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering and Computer Science and Sloan School of Management, MIT, Cambridge, Massachusetts 02139","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5017238021"],"corresponding_institution_ids":["https://openalex.org/I141596103"],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":10.6489,"has_fulltext":false,"cited_by_count":108,"citation_normalized_percentile":{"value":0.98246377,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"41","issue":"3","first_page":"159","last_page":"173"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.993399977684021,"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.993399977684021,"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/T10698","display_name":"Transportation Planning and Optimization","score":0.9778000116348267,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T11502","display_name":"Facility Location and Emergency Management","score":0.9550999999046326,"subfield":{"id":"https://openalex.org/subfields/1407","display_name":"Organizational Behavior and Human Resource Management"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.8291240930557251},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.7134352922439575},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.633552610874176},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.6184985041618347},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.6088302731513977},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.5746225118637085},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5380840301513672},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5118312239646912},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.47082120180130005},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.46481001377105713},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4582277238368988},{"id":"https://openalex.org/keywords/minimum-degree-spanning-tree","display_name":"Minimum degree spanning tree","score":0.44542330503463745},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4299701750278473},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.42599695920944214},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.41842466592788696},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.30360978841781616},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.20516741275787354}],"concepts":[{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.8291240930557251},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.7134352922439575},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.633552610874176},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.6184985041618347},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.6088302731513977},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.5746225118637085},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5380840301513672},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5118312239646912},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.47082120180130005},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.46481001377105713},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4582277238368988},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.44542330503463745},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4299701750278473},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.42599695920944214},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.41842466592788696},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.30360978841781616},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.20516741275787354},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1002/net.10069","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.10069","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.823.4540","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.823.4540","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://dspace.mit.edu/bitstream/handle/1721.1/5310/OR-359-01.pdf%3Bjsessionid%3D6829687554CA52090A2852D3026DB4A4?sequence%3D1","raw_type":"text"},{"id":"pmh:oai:dspace.mit.edu:1721.1/5310","is_oa":true,"landing_page_url":"http://hdl.handle.net/1721.1/5310","pdf_url":null,"source":{"id":"https://openalex.org/S4306400425","display_name":"DSpace@MIT (Massachusetts Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I63966007","host_organization_name":"Massachusetts Institute of Technology","host_organization_lineage":["https://openalex.org/I63966007"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Working Paper"}],"best_oa_location":{"id":"pmh:oai:dspace.mit.edu:1721.1/5310","is_oa":true,"landing_page_url":"http://hdl.handle.net/1721.1/5310","pdf_url":null,"source":{"id":"https://openalex.org/S4306400425","display_name":"DSpace@MIT (Massachusetts Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I63966007","host_organization_name":"Massachusetts Institute of Technology","host_organization_lineage":["https://openalex.org/I63966007"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Working Paper"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W194519168","https://openalex.org/W561423426","https://openalex.org/W1558071713","https://openalex.org/W2011039300","https://openalex.org/W2019067222","https://openalex.org/W2020586530","https://openalex.org/W2057725412","https://openalex.org/W2069926749","https://openalex.org/W2072970829","https://openalex.org/W2104060777","https://openalex.org/W2108303241","https://openalex.org/W2119918317","https://openalex.org/W2129084394","https://openalex.org/W2138913744","https://openalex.org/W2171985270","https://openalex.org/W4234408051","https://openalex.org/W4247103873"],"related_works":["https://openalex.org/W1584380088","https://openalex.org/W2099915933","https://openalex.org/W2149927264","https://openalex.org/W4308416203","https://openalex.org/W2803918337","https://openalex.org/W2015718828","https://openalex.org/W4295683043","https://openalex.org/W3141326665","https://openalex.org/W2047517090","https://openalex.org/W2350799039"],"abstract_inverted_index":{"Abstract":[0],"We":[1],"formulate":[2],"and":[3,13,62,89,98,110,163],"computationally":[4],"test":[5],"several":[6],"models":[7,76,117,170],"for":[8,51,136,202],"the":[9,32,37,74,137,150,161,169,172,189,209],"Diameter\u2010Constrained":[10],"Minimum":[11],"Spanning":[12],"Steiner":[14,23],"Tree":[15],"Problems,":[16],"which":[17],"seek":[18],"a":[19,27,49,60,120,124,128,134,140],"least\u2010cost":[20],"spanning":[21,64],"or":[22,127],"tree":[24,38,65,122],"subject":[25],"to":[26,58,79,95,182],"(diameter)":[28],"bound":[29,174],"imposed":[30],"on":[31],"number":[33],"of":[34,54,70,152,188,208],"edges":[35],"in":[36,84,139,193],"between":[39],"any":[40],"node":[41,126],"pair.":[42],"A":[43],"traditional":[44],"multicommodity":[45,141],"flow":[46,142],"model":[47,103,143,162],"with":[48,93,123,144,156],"commodity":[50],"every":[52],"pair":[53],"nodes":[55,97],"was":[56],"unable":[57],"solve":[59,81],"20\u2010node":[61],"100\u2010edge":[63],"problem":[66,83,91],"after":[67],"1":[68,87],"week":[69],"computation.":[71],"In":[72],"contrast,":[73],"new":[75,116],"were":[77],"able":[78],"optimality":[80],"this":[82,194],"less":[85],"than":[86,106,112],"second":[88],"larger":[90],"instances":[92],"up":[94],"100":[96],"1000":[99],"edges.":[100],"The":[101,115,184],"largest":[102],"contains":[104],"more":[105,111,180],"250,000":[107],"integer":[108,200],"variables":[109],"125,000":[113],"constraints.":[114,146],"simultaneously":[118],"find":[119],"directed":[121],"central":[125,129],"edge":[130],"that":[131],"serve":[132],"as":[133],"source":[135],"commodities":[138],"hop":[145],"Our":[147],"results":[148],"demonstrate":[149],"power":[151],"using":[153,164],"single\u2010sourcing":[154],"combined":[155],"other":[157],"reformulation":[158],"techniques:":[159],"directing":[160],"hop\u2010indexed":[165],"formulations.":[166],"Enhancements":[167],"improve":[168],"when":[171],"diameter":[173],"is":[175],"odd":[176],"(these":[177],"situations":[178],"are":[179],"difficult":[181],"solve).":[183],"linear":[185],"programming":[186],"relaxation":[187],"best":[190],"formulations":[191],"discussed":[192],"paper":[195],"always":[196],"give":[197],"an":[198],"optimal":[199],"solution":[201],"two":[203],"special,":[204],"polynomially":[205],"solvable":[206],"cases":[207],"problem.":[210],"\u00a9":[211],"2003":[212],"Wiley":[213],"Periodicals,":[214],"Inc.":[215]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":6},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":7}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}