{"id":"https://openalex.org/W2083974195","doi":"https://doi.org/10.1016/0166-218x(87)90020-5","title":"Generalized travelling salesman problem through n sets of nodes: the asymmetrical case","display_name":"Generalized travelling salesman problem through n sets of nodes: the asymmetrical case","publication_year":1987,"publication_date":"1987-11-01","ids":{"openalex":"https://openalex.org/W2083974195","doi":"https://doi.org/10.1016/0166-218x(87)90020-5","mag":"2083974195"},"language":"en","primary_location":{"id":"doi:10.1016/0166-218x(87)90020-5","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0166-218x(87)90020-5","pdf_url":null,"source":{"id":"https://openalex.org/S171741597","display_name":"Discrete Applied Mathematics","issn_l":"0166-218X","issn":["0166-218X","1872-6771"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Applied 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/A5076313841","display_name":"Gilbert Laporte","orcid":"https://orcid.org/0000-0003-0869-1507"},"institutions":[{"id":"https://openalex.org/I108192572","display_name":"HEC Montr\u00e9al","ror":"https://ror.org/05ww3wq27","country_code":"CA","type":"education","lineage":["https://openalex.org/I108192572"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Gilbert Laporte","raw_affiliation_strings":["Ecole des Hautes Etudes Commerciales de Montr\u00e9al, 5255 avenue Decelles, Montr\u00e9al, Qu\u00e9bec H3T 1V6, Canada"],"affiliations":[{"raw_affiliation_string":"Ecole des Hautes Etudes Commerciales de Montr\u00e9al, 5255 avenue Decelles, Montr\u00e9al, Qu\u00e9bec H3T 1V6, Canada","institution_ids":["https://openalex.org/I108192572"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5009542869","display_name":"H\u00e9l\u00e8ne Mercure","orcid":null},"institutions":[{"id":"https://openalex.org/I108192572","display_name":"HEC Montr\u00e9al","ror":"https://ror.org/05ww3wq27","country_code":"CA","type":"education","lineage":["https://openalex.org/I108192572"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"H\u00e9l\u00e8ne Mercure","raw_affiliation_strings":["Ecole des Hautes Etudes Commerciales de Montr\u00e9al, 5255 avenue Decelles, Montr\u00e9al, Qu\u00e9bec H3T 1V6, Canada"],"affiliations":[{"raw_affiliation_string":"Ecole des Hautes Etudes Commerciales de Montr\u00e9al, 5255 avenue Decelles, Montr\u00e9al, Qu\u00e9bec H3T 1V6, Canada","institution_ids":["https://openalex.org/I108192572"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5073496189","display_name":"Yves Nobert","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yves Nobert","raw_affiliation_strings":["D\u00e9partment des Sciences administratives, Universit\u00e9 du Qu\u00e9be \u00e0 Montr\u00e9al, 1495, rue Saint-Denis, Montr\u00e9al, Qu\u00e9bec H3C 3P8, Canada"],"affiliations":[{"raw_affiliation_string":"D\u00e9partment des Sciences administratives, Universit\u00e9 du Qu\u00e9be \u00e0 Montr\u00e9al, 1495, rue Saint-Denis, Montr\u00e9al, Qu\u00e9bec H3C 3P8, Canada","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5076313841"],"corresponding_institution_ids":["https://openalex.org/I108192572"],"apc_list":{"value":2750,"currency":"USD","value_usd":2750},"apc_paid":null,"fwci":2.3546,"has_fulltext":false,"cited_by_count":120,"citation_normalized_percentile":{"value":0.89045643,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"18","issue":"2","first_page":"185","last_page":"197"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9987999796867371,"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.9987999796867371,"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.996399998664856,"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/T12288","display_name":"Optimization and Search Problems","score":0.9950000047683716,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.9050437211990356},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.793431282043457},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5706869959831238},{"id":"https://openalex.org/keywords/bottleneck-traveling-salesman-problem","display_name":"Bottleneck traveling salesman problem","score":0.551973283290863},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.5224370360374451},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.50046706199646},{"id":"https://openalex.org/keywords/hamiltonian-path","display_name":"Hamiltonian path","score":0.48187074065208435},{"id":"https://openalex.org/keywords/2-opt","display_name":"2-opt","score":0.47931089997291565},{"id":"https://openalex.org/keywords/traveling-purchaser-problem","display_name":"Traveling purchaser problem","score":0.4615694284439087},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.4316202402114868},{"id":"https://openalex.org/keywords/branch-and-cut","display_name":"Branch and cut","score":0.4190391004085541},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3711871802806854},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.35305172204971313},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.15051263570785522},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.14410507678985596}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.9050437211990356},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.793431282043457},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5706869959831238},{"id":"https://openalex.org/C7668213","wikidata":"https://www.wikidata.org/wiki/Q4949085","display_name":"Bottleneck traveling salesman problem","level":3,"score":0.551973283290863},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.5224370360374451},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.50046706199646},{"id":"https://openalex.org/C86524685","wikidata":"https://www.wikidata.org/wiki/Q273037","display_name":"Hamiltonian path","level":3,"score":0.48187074065208435},{"id":"https://openalex.org/C106472803","wikidata":"https://www.wikidata.org/wiki/Q291440","display_name":"2-opt","level":3,"score":0.47931089997291565},{"id":"https://openalex.org/C4331618","wikidata":"https://www.wikidata.org/wiki/Q7836034","display_name":"Traveling purchaser problem","level":4,"score":0.4615694284439087},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.4316202402114868},{"id":"https://openalex.org/C50797617","wikidata":"https://www.wikidata.org/wiki/Q498566","display_name":"Branch and cut","level":3,"score":0.4190391004085541},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3711871802806854},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.35305172204971313},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.15051263570785522},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.14410507678985596},{"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.1016/0166-218x(87)90020-5","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0166-218x(87)90020-5","pdf_url":null,"source":{"id":"https://openalex.org/S171741597","display_name":"Discrete Applied Mathematics","issn_l":"0166-218X","issn":["0166-218X","1872-6771"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Applied Mathematics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W108694910","https://openalex.org/W2028046799","https://openalex.org/W2042986967","https://openalex.org/W2061637847","https://openalex.org/W2140784080","https://openalex.org/W2146870367","https://openalex.org/W2148673189","https://openalex.org/W2506633573","https://openalex.org/W6604433457"],"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/W2125126715","https://openalex.org/W2259723333","https://openalex.org/W2155694204","https://openalex.org/W4365506312","https://openalex.org/W1002323541"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":11},{"year":2020,"cited_by_count":7},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":9},{"year":2017,"cited_by_count":8},{"year":2016,"cited_by_count":6},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":6}],"updated_date":"2026-04-17T18:11:37.981687","created_date":"2025-10-10T00:00:00"}