{"id":"https://openalex.org/W2059768321","doi":"https://doi.org/10.3844/ajassp.2007.932.937","title":"New Integer Programming Formulations of the Generalized Travelling Salesman Problem","display_name":"New Integer Programming Formulations of the Generalized Travelling Salesman Problem","alternate_titles":[],"publication_year":2007,"publication_date":"2007-11-01","ids":{"openalex":"https://openalex.org/W2059768321","doi":"https://doi.org/10.3844/ajassp.2007.932.937","mag":"2059768321"},"language":"en","primary_location":{"id":"doi:10.3844/ajassp.2007.932.937","doi":"https://doi.org/10.3844/ajassp.2007.932.937","is_oa":true,"landing_page_url":"https://doi.org/10.3844/ajassp.2007.932.937","pdf_url":"https://doi.org/10.3844/ajassp.2007.932.937","source":{"id":"https://openalex.org/S33447932","display_name":"American Journal of Applied Sciences","issn_l":"1546-9239","issn":["1546-9239","1554-3641"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-scientific","cwts-core","jufo-1"],"host_organization":"https://openalex.org/P4322697006","host_organization_name":"Science Publications","host_organization_lineage":["https://openalex.org/P4322697006"],"host_organization_lineage_names":["Science Publications"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"American Journal of Applied Sciences","raw_type":"journal-article"},"parent_works":[],"lineage":["https://openalex.org/W2059768321"],"child_works_count":0,"type":"article","is_traditional":true,"indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://doi.org/10.3844/ajassp.2007.932.937","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5054561530","display_name":"Petric\u0103 C. Pop","orcid":"https://orcid.org/0000-0002-0626-9284","observed_orcids":["https://orcid.org/0000-0002-0626-9284"]},"institutions":[],"countries":[],"is_corresponding":true,"contributor_roles":[],"raw_author_name":"Petrica C. Pop","raw_affiliation_strings":["Department of Mathematics and Computer Science , Faculty of Sciences , North University of Baia Mare , Romania"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science , Faculty of Sciences , North University of Baia Mare , Romania","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5054561530"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.2603,"has_fulltext":true,"cited_by_count":45,"reviewed_by_count":0,"citation_normalized_percentile":{"value":0.87074796,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":87,"max":98},"biblio":{"volume":"4","issue":"11","first_page":"932","last_page":"937"},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9115999937057495,"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.9115999937057495,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.08100000023841858,"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"}},{"id":"https://openalex.org/T12709","display_name":"Optimization and Mathematical Programming","score":0.0010999999940395355,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/integer-programming-model","display_name":"integer programming formulation","score":0.9620000123977661},{"id":"https://openalex.org/keywords/compact-formulation","display_name":"compact formulation","score":0.9769999980926514},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"combinatorial optimization","score":0.7269999980926514},{"id":"https://openalex.org/keywords/node-clustering","display_name":"node clustering","score":0.38600000739097595}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.8489277958869934},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.7643254995346069},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5933582782745361},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.5927927494049072},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4364747405052185},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.38408634066581726},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.05345591902732849}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.3844/ajassp.2007.932.937","doi":"https://doi.org/10.3844/ajassp.2007.932.937","is_oa":true,"landing_page_url":"https://doi.org/10.3844/ajassp.2007.932.937","pdf_url":"https://doi.org/10.3844/ajassp.2007.932.937","source":{"id":"https://openalex.org/S33447932","display_name":"American Journal of Applied Sciences","issn_l":"1546-9239","issn":["1546-9239","1554-3641"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-scientific","cwts-core","jufo-1"],"host_organization":"https://openalex.org/P4322697006","host_organization_name":"Science Publications","host_organization_lineage":["https://openalex.org/P4322697006"],"host_organization_lineage_names":["Science Publications"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"American Journal of Applied Sciences","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.136.8997","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.136.8997","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.scipub.org/fulltext/ajas/ajas411932-937.pdf","raw_type":"text"}],"best_oa_location":{"id":"doi:10.3844/ajassp.2007.932.937","doi":"https://doi.org/10.3844/ajassp.2007.932.937","is_oa":true,"landing_page_url":"https://doi.org/10.3844/ajassp.2007.932.937","pdf_url":"https://doi.org/10.3844/ajassp.2007.932.937","source":{"id":"https://openalex.org/S33447932","display_name":"American Journal of Applied Sciences","issn_l":"1546-9239","issn":["1546-9239","1554-3641"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-scientific","cwts-core","jufo-1"],"host_organization":"https://openalex.org/P4322697006","host_organization_name":"Science Publications","host_organization_lineage":["https://openalex.org/P4322697006"],"host_organization_lineage_names":["Science Publications"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"American Journal of Applied Sciences","raw_type":"journal-article"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2059768321.pdf","grobid_xml":"https://content.openalex.org/works/W2059768321.grobid-xml"},"referenced_works_count":9,"referenced_works":["https://openalex.org/W108694910","https://openalex.org/W1512602998","https://openalex.org/W1972335984","https://openalex.org/W2018269848","https://openalex.org/W2019741214","https://openalex.org/W2049287714","https://openalex.org/W2067061580","https://openalex.org/W2077405310","https://openalex.org/W2083974195"],"related_works":["https://openalex.org/W18604930","https://openalex.org/W1972335984","https://openalex.org/W2107535850","https://openalex.org/W2018269848","https://openalex.org/W3034945476","https://openalex.org/W4389399242","https://openalex.org/W108694910","https://openalex.org/W1984451472"],"abstract_inverted_index":{"The":[0],"Generalized":[1],"Travelling":[2],"Salesman":[3],"Problem,":[4],"denoted":[5],"by":[6,124],"GTSP,":[7],"is":[8,83],"a":[9,84],"variant":[10],"of":[11,22,52,79,87,90,132],"the":[12,20,33,53,61,65,74,77,88,93,102,113,121,133],"classical":[13],"travelling":[14],"salesman":[15,34],"problem":[16],"(TSP),":[17],"in":[18,73,92],"which":[19],"nodes":[21,91],"an":[23,56],"undirected":[24],"graph":[25],"are":[26,71,140],"partitioned":[27],"into":[28],"node":[29,40,118],"sets":[30],"(clusters)":[31],"and":[32,81,117,120,128],"has":[35],"to":[36,97,136],"visit":[37],"exactly":[38],"one":[39,123],"from":[41,60],"every":[42],"cluster.":[43],"In":[44,95],"this":[45],"paper":[46],"we":[47,69,104],"described":[48],"six":[49],"distinct":[50],"formulations":[51,63,67,100],"GTSP":[54,103],"as":[55],"integer":[57],"programming.":[58],"Apart":[59],"standard":[62],"all":[64],"new":[66],"that":[68,76],"describe":[70],"'compact'":[72],"sense":[75],"number":[78,89],"constraints":[80],"variables":[82,111,119],"polynomial":[85],"function":[86],"problem.":[94],"order":[96],"provide":[98],"compact":[99],"for":[101],"used":[105],"two":[106],"approaches":[107],"using":[108],"auxiliary":[109],"flow":[110],"beyond":[112],"natural":[114],"binary":[115],"edge":[116],"second":[122],"distinguishing":[125],"between":[126],"global":[127],"local":[129],"variables.":[130],"Comparisons":[131],"polytopes":[134],"corresponding":[135],"their":[137],"linear":[138],"relaxations":[139],"established.":[141]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2059768321","counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":4},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":2}],"updated_date":"2026-11-21T10:27:49.728292","created_date":"2016-06-24T00:00:00"}
