{"id":"https://openalex.org/W2169689220","doi":"https://doi.org/10.1002/net.3230110109","title":"A more compact formulation of the symmetric multiple traveling salesman problem with fixed charges","display_name":"A more compact formulation of the symmetric multiple traveling salesman problem with fixed charges","publication_year":1981,"publication_date":"1981-03-01","ids":{"openalex":"https://openalex.org/W2169689220","doi":"https://doi.org/10.1002/net.3230110109","mag":"2169689220"},"language":"en","primary_location":{"id":"doi:10.1002/net.3230110109","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230110109","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/A5035494388","display_name":"Joseph H. Discenza","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Joseph Henry Discenza","raw_affiliation_strings":["8692 Young Court, Springfield, Virginia 22153"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"8692 Young Court, Springfield, Virginia 22153","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5035494388"],"corresponding_institution_ids":[],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":1.7595,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.86713287,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":95},"biblio":{"volume":"11","issue":"1","first_page":"73","last_page":"75"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9588000178337097,"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.9588000178337097,"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/T12709","display_name":"Optimization and Mathematical Programming","score":0.9524999856948853,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.9623683094978333},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.5963640213012695},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5504822731018066},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5438641905784607},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.4999880790710449},{"id":"https://openalex.org/keywords/2-opt","display_name":"2-opt","score":0.4746984839439392},{"id":"https://openalex.org/keywords/bottleneck-traveling-salesman-problem","display_name":"Bottleneck traveling salesman problem","score":0.4443843960762024},{"id":"https://openalex.org/keywords/traveling-purchaser-problem","display_name":"Traveling purchaser problem","score":0.44235652685165405},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.41398561000823975},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.35653942823410034}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.9623683094978333},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.5963640213012695},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5504822731018066},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5438641905784607},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4999880790710449},{"id":"https://openalex.org/C106472803","wikidata":"https://www.wikidata.org/wiki/Q291440","display_name":"2-opt","level":3,"score":0.4746984839439392},{"id":"https://openalex.org/C7668213","wikidata":"https://www.wikidata.org/wiki/Q4949085","display_name":"Bottleneck traveling salesman problem","level":3,"score":0.4443843960762024},{"id":"https://openalex.org/C4331618","wikidata":"https://www.wikidata.org/wiki/Q7836034","display_name":"Traveling purchaser problem","level":4,"score":0.44235652685165405},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.41398561000823975},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.35653942823410034},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/net.3230110109","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230110109","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":[{"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8","score":0.4099999964237213}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":1,"referenced_works":["https://openalex.org/W2153142800"],"related_works":["https://openalex.org/W4389782626","https://openalex.org/W4376138746","https://openalex.org/W2359992618","https://openalex.org/W2361554335","https://openalex.org/W4220987199","https://openalex.org/W2171568915","https://openalex.org/W2362402143","https://openalex.org/W2265604726","https://openalex.org/W8433631","https://openalex.org/W2033851048"],"abstract_inverted_index":{"Abstract":[0],"The":[1,47],"multiple":[2],"traveling":[3,16],"salesman":[4,17],"problem":[5,18,57],"with":[6,33],"fixed":[7,63],"charges":[8],"(MTSPF)":[9],"is":[10,42],"an":[11],"extension":[12],"of":[13,45,61,70,94],"the":[14,43,55,62,78],"standard":[15],"(TSP).":[19],"Previous":[20],"work":[21],"by":[22,91],"Hong":[23],"and":[24],"Padberg":[25],"showed":[26],"how":[27],"to":[28,30,53],"transform":[29],"a":[31,81,92],"TSP":[32],"n":[34],"+":[35,37],"m":[36,41],"4":[38],"nodes,":[39],"where":[40],"number":[44],"salesmen.":[46],"four":[48,85],"extra":[49,86],"nodes":[50,72,87],"were":[51],"included":[52],"prevent":[54],"transformed":[56],"from":[58],"escaping":[59],"part":[60],"costs.":[64],"This":[65],"paper":[66],"shows":[67],"that":[68],"two":[69],"these":[71],"can":[73,88],"be":[74,89],"eliminated":[75],"without":[76],"sacrificing":[77],"formulation":[79],"as":[80],"TSP.":[82],"Further,":[83],"all":[84],"replaced":[90],"pair":[93],"simple":[95],"constraints.":[96],"All":[97],"formulations":[98],"produce":[99],"equivalent":[100],"solutions.":[101]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}