{"id":"https://openalex.org/W2020898729","doi":"https://doi.org/10.1137/0402038","title":"The Asymmetric Assignment Problem and Some New Facets of the Traveling Salesman Polytope on a Directed Graph","display_name":"The Asymmetric Assignment Problem and Some New Facets of the Traveling Salesman Polytope on a Directed Graph","publication_year":1989,"publication_date":"1989-11-01","ids":{"openalex":"https://openalex.org/W2020898729","doi":"https://doi.org/10.1137/0402038","mag":"2020898729"},"language":"en","primary_location":{"id":"doi:10.1137/0402038","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0402038","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"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 Discrete Mathematics","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/A5072070820","display_name":"Egon Balas","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Egon Balas","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5072070820"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.1707,"has_fulltext":false,"cited_by_count":47,"citation_normalized_percentile":{"value":0.86698512,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"2","issue":"4","first_page":"425","last_page":"451"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9955000281333923,"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.9955000281333923,"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.9944000244140625,"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.8836312294006348},{"id":"https://openalex.org/keywords/digraph","display_name":"Digraph","score":0.7917506694793701},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7289090752601624},{"id":"https://openalex.org/keywords/polytope","display_name":"Polytope","score":0.7178638577461243},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.5664699077606201},{"id":"https://openalex.org/keywords/convex-hull","display_name":"Convex hull","score":0.510705292224884},{"id":"https://openalex.org/keywords/birkhoff-polytope","display_name":"Birkhoff polytope","score":0.4736774265766144},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.44461187720298767},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.41117921471595764},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.2874870300292969},{"id":"https://openalex.org/keywords/convex-set","display_name":"Convex set","score":0.13924840092658997},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.13534486293792725},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.09628647565841675}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8836312294006348},{"id":"https://openalex.org/C2779145032","wikidata":"https://www.wikidata.org/wiki/Q191494","display_name":"Digraph","level":2,"score":0.7917506694793701},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7289090752601624},{"id":"https://openalex.org/C145691206","wikidata":"https://www.wikidata.org/wiki/Q747980","display_name":"Polytope","level":2,"score":0.7178638577461243},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.5664699077606201},{"id":"https://openalex.org/C206194317","wikidata":"https://www.wikidata.org/wiki/Q1138624","display_name":"Convex hull","level":3,"score":0.510705292224884},{"id":"https://openalex.org/C206304794","wikidata":"https://www.wikidata.org/wiki/Q4916482","display_name":"Birkhoff polytope","level":5,"score":0.4736774265766144},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.44461187720298767},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.41117921471595764},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.2874870300292969},{"id":"https://openalex.org/C49870271","wikidata":"https://www.wikidata.org/wiki/Q193657","display_name":"Convex set","level":4,"score":0.13924840092658997},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.13534486293792725},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.09628647565841675},{"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/0402038","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0402038","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"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 Discrete Mathematics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W5720473","https://openalex.org/W205047139","https://openalex.org/W1540760152","https://openalex.org/W1975099798","https://openalex.org/W1995246641","https://openalex.org/W2006934540","https://openalex.org/W2008200956","https://openalex.org/W2018949572","https://openalex.org/W2075339720","https://openalex.org/W2145243417","https://openalex.org/W2161305900","https://openalex.org/W2399100674"],"related_works":["https://openalex.org/W2237223497","https://openalex.org/W4301600724","https://openalex.org/W4298021137","https://openalex.org/W2963699585","https://openalex.org/W4381713517","https://openalex.org/W1568298881","https://openalex.org/W205047139","https://openalex.org/W2082133472","https://openalex.org/W2020898729","https://openalex.org/W2144046557"],"abstract_inverted_index":{"An":[0],"assignment":[1,30],"(spanning":[2],"union":[3],"of":[4,21,36,40,46,87,93],"node-disjoint":[5],"dicycles)":[6],"in":[7],"a":[8,55],"directed":[9],"graph":[10],"is":[11,32,48,89],"called":[12],"asymmetric":[13,29,42],"if":[14],"it":[15],"contains":[16],"at":[17],"most":[18],"one":[19],"arc":[20],"each":[22,92],"pair":[23],"$(i,":[24],"j)$,":[25],"$(":[26],"j,i)$.":[27],"The":[28,65],"polytope":[31,52,78],"the":[33,37,75,81,94],"convex":[34],"hull":[35],"incidence":[38],"vectors":[39],"all":[41],"assignments.":[43],"A":[44],"class":[45,86],"facets":[47,69,88],"described":[49],"for":[50,74],"this":[51,85],"defined":[53,79],"on":[54,80],"complete":[56],"digraph,":[57],"associated":[58],"with":[59],"certain":[60],"odd-length":[61],"closed":[62],"alternating":[63],"trails.":[64],"inequalities":[66],"defining":[67],"these":[68],"are":[70],"also":[71],"facet":[72],"inducing":[73],"traveling":[76],"salesman":[77],"same":[82],"digraph.":[83],"Furthermore,":[84],"distinct":[90],"from":[91],"classes":[95],"identified":[96],"earlier.":[97]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}