{"id":"https://openalex.org/W1984968317","doi":"https://doi.org/10.1137/0804039","title":"Outer-Facial Graphs and the Traveling Salesman Problem","display_name":"Outer-Facial Graphs and the Traveling Salesman Problem","publication_year":1994,"publication_date":"1994-08-01","ids":{"openalex":"https://openalex.org/W1984968317","doi":"https://doi.org/10.1137/0804039","mag":"1984968317"},"language":"en","primary_location":{"id":"doi:10.1137/0804039","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0804039","pdf_url":null,"source":{"id":"https://openalex.org/S928796702","display_name":"SIAM Journal on Optimization","issn_l":"1052-6234","issn":["1052-6234","1095-7189"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Optimization","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/A5079559219","display_name":"David Hartvigsen","orcid":"https://orcid.org/0000-0001-8353-5577"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"David Hartvigsen","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5016219449","display_name":"William R. Pulleyblank","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"W. R. Pulleyblank","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.18479797,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"4","issue":"3","first_page":"676","last_page":"689"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9990000128746033,"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.9990000128746033,"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.9912999868392944,"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.9869999885559082,"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/combinatorics","display_name":"Combinatorics","score":0.7268385887145996},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7021005749702454},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.6926275491714478},{"id":"https://openalex.org/keywords/convex-hull","display_name":"Convex hull","score":0.6043345928192139},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.4821329116821289},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.47273340821266174},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.42531847953796387},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.41605550050735474},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.3307421803474426},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.2658447325229645},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.16919371485710144}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7268385887145996},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7021005749702454},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.6926275491714478},{"id":"https://openalex.org/C206194317","wikidata":"https://www.wikidata.org/wiki/Q1138624","display_name":"Convex hull","level":3,"score":0.6043345928192139},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.4821329116821289},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.47273340821266174},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.42531847953796387},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.41605550050735474},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.3307421803474426},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.2658447325229645},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.16919371485710144},{"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.1137/0804039","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0804039","pdf_url":null,"source":{"id":"https://openalex.org/S928796702","display_name":"SIAM Journal on Optimization","issn_l":"1052-6234","issn":["1052-6234","1095-7189"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Optimization","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Partnerships for the goals","id":"https://metadata.un.org/sdg/17","score":0.6100000143051147}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W1540760152","https://openalex.org/W1968919074","https://openalex.org/W1987374783","https://openalex.org/W1994556169","https://openalex.org/W2029242918","https://openalex.org/W2033662447","https://openalex.org/W2086498273"],"related_works":["https://openalex.org/W4300075580","https://openalex.org/W2952648278","https://openalex.org/W2258906315","https://openalex.org/W1560307591","https://openalex.org/W4386528600","https://openalex.org/W2048639803","https://openalex.org/W4301463689","https://openalex.org/W2011729204","https://openalex.org/W2605313623","https://openalex.org/W4390681216"],"abstract_inverted_index":{"An":[0],"outer-facial":[1,151,167,187],"graph":[2,7,72,152,168],"is":[3,23,64,89,110,153,191],"a":[4,12,42,71,74,95,156,173,184,196],"planar":[5],"3-connected":[6],"with":[8,18],"one":[9],"face":[10],"having":[11],"node":[13],"or":[14],"edge":[15,36],"in":[16,31,53,130,139,149],"common":[17],"every":[19],"other":[20],"face.":[21],"It":[22],"shown":[24],"that":[25,83],"the":[26,45,48,68,105,115,119,123,140,143,147,176,180,200,205],"traveling":[27,162],"salesman":[28,50,163],"problem":[29,51],"(TSP)":[30],"such":[32],"graphs,":[33,188],"for":[34,126,199],"arbitrary":[35],"weights,":[37],"can":[38,169],"be":[39,98,170],"transformed":[40],"into":[41,73],"variant":[43],"of":[44,70,76,80,104,118,122,142,165,175,186],"TSP":[46,148],"(called":[47],"international":[49],"(ISP))":[52],"an":[54,62,127,150,166],"associated":[55],"Halin":[56],"graph.":[57,145],"In":[58],"its":[59],"simplest":[60],"form,":[61],"ISP":[63,128],"obtained":[65,129,171],"by":[66,179],"partitioning":[67],"nodes":[69],"set":[75],"countries.":[77],"A":[78,107],"tour":[79],"minimum":[81],"cost":[82],"visits":[84],"each":[85,93],"country":[86,94],"exactly":[87],"once":[88],"required,":[90],"but":[91],"within":[92],"visit":[96],"may":[97],"made":[99],"to":[100,113,155,193],"any":[101],"nonempty":[102],"subset":[103],"nodes.":[106],"linear":[108,134,158],"system":[109,135,198,203],"described":[111],"sufficient":[112],"define":[114],"convex":[116],"hull":[117],"incidence":[120],"vectors":[121],"feasible":[124],"tours":[125],"this":[131,189],"fashion.":[132],"This":[133,202],"has":[136],"size":[137,141],"polynomial":[138],"original":[144],"Thus,":[146],"reduced":[154],"small":[157],"programming":[159],"problem.":[160],"The":[161],"polytope":[164],"as":[172],"projection":[174],"polyhedron":[177],"defined":[178],"above":[181],"system.":[182],"For":[183],"class":[185],"fact":[190],"used":[192],"give":[194],"explicitly":[195],"defining":[197],"TSP.":[201],"includes":[204],"well-known":[206],"subtour":[207],"elimination":[208],"constraints":[209],"and":[210],"comb":[211],"inequalities.":[212]},"counts_by_year":[{"year":2017,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}