{"id":"https://openalex.org/W185619668","doi":"https://doi.org/10.1007/978-3-642-32147-4_11","title":"The Uncapacitated Asymmetric Traveling Salesman Problem with Multiple Stacks","display_name":"The Uncapacitated Asymmetric Traveling Salesman Problem with Multiple Stacks","publication_year":2012,"publication_date":"2012-01-01","ids":{"openalex":"https://openalex.org/W185619668","doi":"https://doi.org/10.1007/978-3-642-32147-4_11","mag":"185619668"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-32147-4_11","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-32147-4_11","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"conference-paper","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/A5087488964","display_name":"Sylvie Borne","orcid":null},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I4210091279","display_name":"Universit\u00e9 Sorbonne Paris Nord","ror":"https://ror.org/0199hds37","country_code":"FR","type":"education","lineage":["https://openalex.org/I4210091279"]},{"id":"https://openalex.org/I4210156583","display_name":"Laboratoire d'Informatique de Paris-Nord","ror":"https://ror.org/05g1zjw44","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I4210091279","https://openalex.org/I4210156583","https://openalex.org/I4210159245"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Sylvie Borne","raw_affiliation_strings":["Laboratoire d\u2019Informatique de Paris-Nord, UMR CNRS 7030, Universit\u00e9 Paris, 13 99, avenue J-B Cl\u00e9ment, 93430, Villetaneuse, France","Laboratoire d'Informatique de Paris-Nord, UMR CNRS 7030, Universit\u00e9 Paris, 13 99, avenue J-B Cl\u00e9ment, 93430, Villetaneuse, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Laboratoire d\u2019Informatique de Paris-Nord, UMR CNRS 7030, Universit\u00e9 Paris, 13 99, avenue J-B Cl\u00e9ment, 93430, Villetaneuse, France","institution_ids":["https://openalex.org/I4210156583","https://openalex.org/I1294671590","https://openalex.org/I4210091279"]},{"raw_affiliation_string":"Laboratoire d'Informatique de Paris-Nord, UMR CNRS 7030, Universit\u00e9 Paris, 13 99, avenue J-B Cl\u00e9ment, 93430, Villetaneuse, France","institution_ids":["https://openalex.org/I4210156583","https://openalex.org/I1294671590","https://openalex.org/I4210091279"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5067831455","display_name":"Roland Grappe","orcid":"https://orcid.org/0000-0002-7093-2175"},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I4210091279","display_name":"Universit\u00e9 Sorbonne Paris Nord","ror":"https://ror.org/0199hds37","country_code":"FR","type":"education","lineage":["https://openalex.org/I4210091279"]},{"id":"https://openalex.org/I4210156583","display_name":"Laboratoire d'Informatique de Paris-Nord","ror":"https://ror.org/05g1zjw44","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I4210091279","https://openalex.org/I4210156583","https://openalex.org/I4210159245"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Roland Grappe","raw_affiliation_strings":["Laboratoire d\u2019Informatique de Paris-Nord, UMR CNRS 7030, Universit\u00e9 Paris, 13 99, avenue J-B Cl\u00e9ment, 93430, Villetaneuse, France","Laboratoire d'Informatique de Paris-Nord, UMR CNRS 7030, Universit\u00e9 Paris, 13 99, avenue J-B Cl\u00e9ment, 93430, Villetaneuse, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Laboratoire d\u2019Informatique de Paris-Nord, UMR CNRS 7030, Universit\u00e9 Paris, 13 99, avenue J-B Cl\u00e9ment, 93430, Villetaneuse, France","institution_ids":["https://openalex.org/I4210156583","https://openalex.org/I1294671590","https://openalex.org/I4210091279"]},{"raw_affiliation_string":"Laboratoire d'Informatique de Paris-Nord, UMR CNRS 7030, Universit\u00e9 Paris, 13 99, avenue J-B Cl\u00e9ment, 93430, Villetaneuse, France","institution_ids":["https://openalex.org/I4210156583","https://openalex.org/I1294671590","https://openalex.org/I4210091279"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5065784195","display_name":"Mathieu Lacroix","orcid":"https://orcid.org/0000-0001-8385-3890"},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I4210091279","display_name":"Universit\u00e9 Sorbonne Paris Nord","ror":"https://ror.org/0199hds37","country_code":"FR","type":"education","lineage":["https://openalex.org/I4210091279"]},{"id":"https://openalex.org/I4210156583","display_name":"Laboratoire d'Informatique de Paris-Nord","ror":"https://ror.org/05g1zjw44","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I4210091279","https://openalex.org/I4210156583","https://openalex.org/I4210159245"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Mathieu Lacroix","raw_affiliation_strings":["Laboratoire d\u2019Informatique de Paris-Nord, UMR CNRS 7030, Universit\u00e9 Paris, 13 99, avenue J-B Cl\u00e9ment, 93430, Villetaneuse, France","Laboratoire d'Informatique de Paris-Nord, UMR CNRS 7030, Universit\u00e9 Paris, 13 99, avenue J-B Cl\u00e9ment, 93430, Villetaneuse, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Laboratoire d\u2019Informatique de Paris-Nord, UMR CNRS 7030, Universit\u00e9 Paris, 13 99, avenue J-B Cl\u00e9ment, 93430, Villetaneuse, France","institution_ids":["https://openalex.org/I4210156583","https://openalex.org/I1294671590","https://openalex.org/I4210091279"]},{"raw_affiliation_string":"Laboratoire d'Informatique de Paris-Nord, UMR CNRS 7030, Universit\u00e9 Paris, 13 99, avenue J-B Cl\u00e9ment, 93430, Villetaneuse, France","institution_ids":["https://openalex.org/I4210156583","https://openalex.org/I1294671590","https://openalex.org/I4210091279"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"105","last_page":"116"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9988999962806702,"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.9988999962806702,"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.9955999851226807,"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/T12288","display_name":"Optimization and Search Problems","score":0.9922999739646912,"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.9297933578491211},{"id":"https://openalex.org/keywords/hamiltonian-path","display_name":"Hamiltonian path","score":0.720101535320282},{"id":"https://openalex.org/keywords/bottleneck-traveling-salesman-problem","display_name":"Bottleneck traveling salesman problem","score":0.6981761455535889},{"id":"https://openalex.org/keywords/polytope","display_name":"Polytope","score":0.6891501545906067},{"id":"https://openalex.org/keywords/traveling-purchaser-problem","display_name":"Traveling purchaser problem","score":0.6055956482887268},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5740193724632263},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.5228234529495239},{"id":"https://openalex.org/keywords/convex-hull","display_name":"Convex hull","score":0.521704375743866},{"id":"https://openalex.org/keywords/hamiltonian","display_name":"Hamiltonian (control theory)","score":0.5199833512306213},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.4935816526412964},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4585355222225189},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.4555356502532959},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.45175424218177795},{"id":"https://openalex.org/keywords/2-opt","display_name":"2-opt","score":0.4239605665206909},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.4146789312362671},{"id":"https://openalex.org/keywords/branch-and-cut","display_name":"Branch and cut","score":0.41018882393836975},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4087122976779938},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.37314116954803467},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.2721741795539856},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.26782500743865967}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.9297933578491211},{"id":"https://openalex.org/C86524685","wikidata":"https://www.wikidata.org/wiki/Q273037","display_name":"Hamiltonian path","level":3,"score":0.720101535320282},{"id":"https://openalex.org/C7668213","wikidata":"https://www.wikidata.org/wiki/Q4949085","display_name":"Bottleneck traveling salesman problem","level":3,"score":0.6981761455535889},{"id":"https://openalex.org/C145691206","wikidata":"https://www.wikidata.org/wiki/Q747980","display_name":"Polytope","level":2,"score":0.6891501545906067},{"id":"https://openalex.org/C4331618","wikidata":"https://www.wikidata.org/wiki/Q7836034","display_name":"Traveling purchaser problem","level":4,"score":0.6055956482887268},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5740193724632263},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.5228234529495239},{"id":"https://openalex.org/C206194317","wikidata":"https://www.wikidata.org/wiki/Q1138624","display_name":"Convex hull","level":3,"score":0.521704375743866},{"id":"https://openalex.org/C130787639","wikidata":"https://www.wikidata.org/wiki/Q5645293","display_name":"Hamiltonian (control theory)","level":2,"score":0.5199833512306213},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.4935816526412964},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4585355222225189},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4555356502532959},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.45175424218177795},{"id":"https://openalex.org/C106472803","wikidata":"https://www.wikidata.org/wiki/Q291440","display_name":"2-opt","level":3,"score":0.4239605665206909},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.4146789312362671},{"id":"https://openalex.org/C50797617","wikidata":"https://www.wikidata.org/wiki/Q498566","display_name":"Branch and cut","level":3,"score":0.41018882393836975},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4087122976779938},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.37314116954803467},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.2721741795539856},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.26782500743865967},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/978-3-642-32147-4_11","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-32147-4_11","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.402.8040","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.402.8040","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://lipn.univ-paris13.fr/~lacroix/Documents/Papiers/stackTSP_lncs.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/10","score":0.550000011920929,"display_name":"Reduced inequalities"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1571087346","https://openalex.org/W1980537145","https://openalex.org/W1995133416","https://openalex.org/W2008642135","https://openalex.org/W2020737022","https://openalex.org/W2033520777","https://openalex.org/W2041215255","https://openalex.org/W2068330535","https://openalex.org/W2103427291","https://openalex.org/W2125126715","https://openalex.org/W2168881324","https://openalex.org/W2169677796","https://openalex.org/W2963946378"],"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/W2362402143","https://openalex.org/W2125126715","https://openalex.org/W2155694204","https://openalex.org/W2044119054","https://openalex.org/W2105006450"],"abstract_inverted_index":null,"counts_by_year":[{"year":2016,"cited_by_count":3},{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}