{"id":"https://openalex.org/W2087132085","doi":"https://doi.org/10.1002/net.3230230205","title":"Shortest paths, single origin\u2010destination network design, and associated polyhedra","display_name":"Shortest paths, single origin\u2010destination network design, and associated polyhedra","publication_year":1993,"publication_date":"1993-03-01","ids":{"openalex":"https://openalex.org/W2087132085","doi":"https://doi.org/10.1002/net.3230230205","mag":"2087132085"},"language":"en","primary_location":{"id":"doi:10.1002/net.3230230205","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230230205","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":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5023919615","display_name":"Thomas L. Magnanti","orcid":"https://orcid.org/0000-0002-0771-3850"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Thomas L. Magnanti","raw_affiliation_strings":["Sloan School of Management, MIT, Cambridge, Massachusetts 02139","Sloan School of Management, MIT Cambridge Massachusetts 02139"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Sloan School of Management, MIT, Cambridge, Massachusetts 02139","institution_ids":[]},{"raw_affiliation_string":"Sloan School of Management, MIT Cambridge Massachusetts 02139","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5084536803","display_name":"Prakash Mirchandani","orcid":"https://orcid.org/0000-0003-3436-9378"},"institutions":[{"id":"https://openalex.org/I170201317","display_name":"University of Pittsburgh","ror":"https://ror.org/01an3r305","country_code":"US","type":"education","lineage":["https://openalex.org/I170201317"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Prakash Mirchandani","raw_affiliation_strings":["Katz Graduate School of Business, University of Pittsburgh, Pittsburgh, Pennsylvania 15260"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Katz Graduate School of Business, University of Pittsburgh, Pittsburgh, Pennsylvania 15260","institution_ids":["https://openalex.org/I170201317"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":3750,"currency":"USD","value_usd":3750},"apc_paid":null,"fwci":4.1656,"has_fulltext":false,"cited_by_count":94,"citation_normalized_percentile":{"value":0.94204049,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"23","issue":"2","first_page":"103","last_page":"121"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11502","display_name":"Facility Location and Emergency Management","score":0.9997000098228455,"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"}},"topics":[{"id":"https://openalex.org/T11502","display_name":"Facility Location and Emergency Management","score":0.9997000098228455,"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"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9983999729156494,"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.996999979019165,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.7819666862487793},{"id":"https://openalex.org/keywords/polyhedron","display_name":"Polyhedron","score":0.7602986693382263},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.6740282773971558},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6433246731758118},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5888761878013611},{"id":"https://openalex.org/keywords/facility-location-problem","display_name":"Facility location problem","score":0.5870949029922485},{"id":"https://openalex.org/keywords/network-planning-and-design","display_name":"Network planning and design","score":0.5854092240333557},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.5411038398742676},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5186352133750916},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.5073606371879578},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.4717562794685364},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.454472154378891},{"id":"https://openalex.org/keywords/container","display_name":"Container (type theory)","score":0.4307164251804352},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.42524996399879456},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.41919466853141785},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.27872055768966675},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.18347430229187012},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.11185944080352783}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7819666862487793},{"id":"https://openalex.org/C54829058","wikidata":"https://www.wikidata.org/wiki/Q172937","display_name":"Polyhedron","level":2,"score":0.7602986693382263},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.6740282773971558},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6433246731758118},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5888761878013611},{"id":"https://openalex.org/C108005400","wikidata":"https://www.wikidata.org/wiki/Q1305598","display_name":"Facility location problem","level":2,"score":0.5870949029922485},{"id":"https://openalex.org/C114563136","wikidata":"https://www.wikidata.org/wiki/Q19725982","display_name":"Network planning and design","level":2,"score":0.5854092240333557},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.5411038398742676},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5186352133750916},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.5073606371879578},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.4717562794685364},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.454472154378891},{"id":"https://openalex.org/C2781018962","wikidata":"https://www.wikidata.org/wiki/Q5164884","display_name":"Container (type theory)","level":2,"score":0.4307164251804352},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.42524996399879456},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.41919466853141785},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.27872055768966675},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.18347430229187012},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.11185944080352783},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","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/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/net.3230230205","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230230205","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"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/9","display_name":"Industry, innovation and infrastructure","score":0.5799999833106995}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W1967088945","https://openalex.org/W1977545325","https://openalex.org/W1980085532","https://openalex.org/W2002111665","https://openalex.org/W2011039300","https://openalex.org/W2016885155","https://openalex.org/W2035363092","https://openalex.org/W2040451606","https://openalex.org/W2049716158","https://openalex.org/W2055494482","https://openalex.org/W2063222326","https://openalex.org/W2069737189","https://openalex.org/W2085809786","https://openalex.org/W2088879400","https://openalex.org/W2096586036","https://openalex.org/W2107474910","https://openalex.org/W2108303241","https://openalex.org/W2120803616","https://openalex.org/W2160408584","https://openalex.org/W2162283386","https://openalex.org/W2171985270","https://openalex.org/W2505968561","https://openalex.org/W2911238614","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2916043681","https://openalex.org/W2896131632","https://openalex.org/W2391438543","https://openalex.org/W2008231869","https://openalex.org/W2039333724","https://openalex.org/W2784330691","https://openalex.org/W1967535279","https://openalex.org/W2169319151","https://openalex.org/W114177608","https://openalex.org/W2015646948"],"abstract_inverted_index":{"Abstract":[0],"We":[1],"study":[2],"a":[3,20,35,46,48,78,112,130,147],"specialized":[4],"version":[5],"of":[6,22,34,37,50,55,65,77,101,120,154,160,175,180,187,191,201],"network":[7,32],"design":[8],"problems":[9,107],"that":[10,72,90,118,129],"arise":[11],"in":[12],"telecommunications,":[13],"transportation,":[14],"and":[15,95,104,139,163,183,209],"other":[16],"industries.":[17],"The":[18],"problem,":[19,26],"generalization":[21],"the":[23,63,75,82,91,102,121,142,155,161,185,189,192],"shortest":[24,113,131],"path":[25,114,132],"is":[27,60],"defined":[28],"on":[29,39,69],"an":[30,135],"undirected":[31],"consisting":[33],"set":[36],"arcs":[38],"which":[40],"we":[41,170],"can":[42],"install":[43],"(load),":[44],"at":[45,81],"cost,":[47],"choice":[49],"up":[51],"to":[52,61,67,195,205],"three":[53,215],"types":[54],"capacitated":[56],"facilities.":[57,216],"Our":[58,86],"objective":[59],"determine":[62],"configuration":[64],"facilities":[66],"load":[68],"each":[70],"arc":[71],"will":[73],"satisfy":[74],"demand":[76],"single":[79],"commodity":[80],"lowest":[83],"possible":[84],"cost.":[85],"results":[87,203],"(i)":[88,206],"demonstrate":[89,184],"single\u2010facility":[92],"loading":[93,106,123,165],"problem":[94,124,193],"certain":[96],"\u201ccommon":[97],"break\u2010even":[98,157],"point\u201d":[99],"versions":[100,119,159],"two\u2010facility":[103,122,162],"three\u2010facility":[105,164],"are":[108,125],"polynomially":[109],"solvable":[110],"as":[111],"problem;":[115],"(ii)":[116,210],"show":[117],"strongly":[126],"NP\u2010hard,":[127],"but":[128],"solution":[133,144],"provides":[134],"asymptotically":[136],"\u201cgood\u201d":[137],"heuristic;":[138],"(iii)":[140],"characterize":[141],"optimal":[143],"(i.e.,":[145],"specify":[146],"linear":[148],"programming":[149],"formulation":[150],"with":[151,212],"integer":[152],"solutions)":[153],"common":[156],"point":[158],"problems.":[166],"In":[167],"this":[168],"development,":[169],"introduce":[171],"two":[172],"new":[173],"families":[174],"facets,":[176],"give":[177],"geometric":[178],"interpretations":[179],"our":[181,202],"results,":[182],"usefulness":[186],"partitioning":[188],"space":[190],"parameters":[194],"establish":[196],"polyhedral":[197],"integrality":[198],"properties.":[199],"Generalizations":[200],"apply":[204],"multicommodity":[207],"applications":[208],"situations":[211],"more":[213],"than":[214],"\u00a9":[217],"1993":[218],"by":[219],"John":[220],"Wiley":[221],"&":[222],"Sons,":[223],"Inc.":[224]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":3},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":2}],"updated_date":"2026-08-21T09:56:20.448147","created_date":"2025-10-10T00:00:00"}