{"id":"https://openalex.org/W2119673940","doi":"https://doi.org/10.1007/s10107-008-0234-9","title":"The traveling salesman problem with pickup and delivery: polyhedral results and a branch-and-cut algorithm","display_name":"The traveling salesman problem with pickup and delivery: polyhedral results and a branch-and-cut algorithm","publication_year":2008,"publication_date":"2008-07-21","ids":{"openalex":"https://openalex.org/W2119673940","doi":"https://doi.org/10.1007/s10107-008-0234-9","mag":"2119673940"},"language":"en","primary_location":{"id":"doi:10.1007/s10107-008-0234-9","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10107-008-0234-9","pdf_url":null,"source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming","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/A5014174890","display_name":"Irina Dumitrescu","orcid":null},"institutions":[{"id":"https://openalex.org/I129604602","display_name":"The University of Sydney","ror":"https://ror.org/0384j8v12","country_code":"AU","type":"education","lineage":["https://openalex.org/I129604602"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Irina Dumitrescu","raw_affiliation_strings":["School of Mathematics and Statistics, The University of Sydney, Sydney, NSW, 2052, Australia","The University of Sydney, School of Mathematics and Statistics, 2052, Sydney, NSW, Australia#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Mathematics and Statistics, The University of Sydney, Sydney, NSW, 2052, Australia","institution_ids":["https://openalex.org/I129604602"]},{"raw_affiliation_string":"The University of Sydney, School of Mathematics and Statistics, 2052, Sydney, NSW, Australia#TAB#","institution_ids":["https://openalex.org/I129604602"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5066260940","display_name":"Stefan R\u00f8pke","orcid":"https://orcid.org/0000-0002-6799-9934"},"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":"Stefan Ropke","raw_affiliation_strings":["Canada Research Chair in Distribution Management, HEC Montr\u00e9al, 3000, chemin de la C\u00f4te-Sainte-Catherine, Montr\u00e9al, H3T 2A7, Canada","HEC Montr\u00e9al, Canada Research Chair in Distribution Management, 3000, chemin de la C\u00f4te-Sainte-Catherine, H3T 2A7, Montr\u00e9al, Canada#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Canada Research Chair in Distribution Management, HEC Montr\u00e9al, 3000, chemin de la C\u00f4te-Sainte-Catherine, Montr\u00e9al, H3T 2A7, Canada","institution_ids":["https://openalex.org/I108192572"]},{"raw_affiliation_string":"HEC Montr\u00e9al, Canada Research Chair in Distribution Management, 3000, chemin de la C\u00f4te-Sainte-Catherine, H3T 2A7, Montr\u00e9al, Canada#TAB#","institution_ids":["https://openalex.org/I108192572"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5016828932","display_name":"Jean\u2010Fran\u00e7ois Cordeau","orcid":"https://orcid.org/0000-0002-4963-1298"},"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":"Jean-Fran\u00e7ois Cordeau","raw_affiliation_strings":["Canada Research Chair in Logistics and Transportation, HEC Montr\u00e9al, 3000, chemin de la C\u00f4te-Sainte-Catherine, Montr\u00e9al, H3T 2A7, Canada","HEC Montr\u00e9al, Canada Research Chair in Logistics and Transportation, 3000, chemin de la C\u00f4te-Sainte-Catherine, H3T 2A7, Montr\u00e9al, Canada#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Canada Research Chair in Logistics and Transportation, HEC Montr\u00e9al, 3000, chemin de la C\u00f4te-Sainte-Catherine, Montr\u00e9al, H3T 2A7, Canada","institution_ids":["https://openalex.org/I108192572"]},{"raw_affiliation_string":"HEC Montr\u00e9al, Canada Research Chair in Logistics and Transportation, 3000, chemin de la C\u00f4te-Sainte-Catherine, H3T 2A7, Montr\u00e9al, Canada#TAB#","institution_ids":["https://openalex.org/I108192572"]}]},{"author_position":"last","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":false,"raw_author_name":"Gilbert Laporte","raw_affiliation_strings":["Canada Research Chair in Distribution Management, HEC Montr\u00e9al, 3000, chemin de la C\u00f4te-Sainte-Catherine, Montr\u00e9al, H3T 2A7, Canada","HEC Montr\u00e9al, Canada Research Chair in Distribution Management, 3000, chemin de la C\u00f4te-Sainte-Catherine, H3T 2A7, Montr\u00e9al, Canada#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Canada Research Chair in Distribution Management, HEC Montr\u00e9al, 3000, chemin de la C\u00f4te-Sainte-Catherine, Montr\u00e9al, H3T 2A7, Canada","institution_ids":["https://openalex.org/I108192572"]},{"raw_affiliation_string":"HEC Montr\u00e9al, Canada Research Chair in Distribution Management, 3000, chemin de la C\u00f4te-Sainte-Catherine, H3T 2A7, Montr\u00e9al, Canada#TAB#","institution_ids":["https://openalex.org/I108192572"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5066260940"],"corresponding_institution_ids":["https://openalex.org/I108192572"],"apc_list":{"value":2890,"currency":"USD","value_usd":2890},"apc_paid":null,"fwci":9.2806,"has_fulltext":false,"cited_by_count":85,"citation_normalized_percentile":{"value":0.97431629,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"121","issue":"2","first_page":"269","last_page":"305"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9998999834060669,"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.9998999834060669,"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.9911999702453613,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9772999882698059,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.9199533462524414},{"id":"https://openalex.org/keywords/pickup","display_name":"Pickup","score":0.7934598922729492},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6949673891067505},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6698964834213257},{"id":"https://openalex.org/keywords/branch-and-cut","display_name":"Branch and cut","score":0.6466781497001648},{"id":"https://openalex.org/keywords/bottleneck-traveling-salesman-problem","display_name":"Bottleneck traveling salesman problem","score":0.6218948364257812},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5933672189712524},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.533166766166687},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.45999276638031006},{"id":"https://openalex.org/keywords/polytope","display_name":"Polytope","score":0.45358115434646606},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.45031407475471497},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.33892491459846497},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.327786386013031},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2648087441921234}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.9199533462524414},{"id":"https://openalex.org/C2776221269","wikidata":"https://www.wikidata.org/wiki/Q572648","display_name":"Pickup","level":3,"score":0.7934598922729492},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6949673891067505},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6698964834213257},{"id":"https://openalex.org/C50797617","wikidata":"https://www.wikidata.org/wiki/Q498566","display_name":"Branch and cut","level":3,"score":0.6466781497001648},{"id":"https://openalex.org/C7668213","wikidata":"https://www.wikidata.org/wiki/Q4949085","display_name":"Bottleneck traveling salesman problem","level":3,"score":0.6218948364257812},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5933672189712524},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.533166766166687},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.45999276638031006},{"id":"https://openalex.org/C145691206","wikidata":"https://www.wikidata.org/wiki/Q747980","display_name":"Polytope","level":2,"score":0.45358115434646606},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.45031407475471497},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.33892491459846497},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.327786386013031},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2648087441921234},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C115961682","wikidata":"https://www.wikidata.org/wiki/Q860623","display_name":"Image (mathematics)","level":2,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/s10107-008-0234-9","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10107-008-0234-9","pdf_url":null,"source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.156.5050","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.156.5050","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.diku.dk/users/sropke/Papers/The%20Traveling%20Salesman%20Problem%20with%20Pickup%20and%20Delivery%20-%20Polyhedral%20Results%20and%20a%20Branch-and-Cut%20Algorithm.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.85.7373","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.85.7373","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://neumann.hec.ca/chairedistributique/common/TSPPD.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W311217234","https://openalex.org/W1554727768","https://openalex.org/W1847516220","https://openalex.org/W1968143987","https://openalex.org/W1980244058","https://openalex.org/W1989019664","https://openalex.org/W1994184140","https://openalex.org/W2031736545","https://openalex.org/W2046687918","https://openalex.org/W2051358678","https://openalex.org/W2061233155","https://openalex.org/W2069903872","https://openalex.org/W2081313488","https://openalex.org/W2091873169","https://openalex.org/W2094766752","https://openalex.org/W2105002757","https://openalex.org/W2110063656","https://openalex.org/W2125375576","https://openalex.org/W2137045485","https://openalex.org/W2163428398","https://openalex.org/W2465183529","https://openalex.org/W2505968561","https://openalex.org/W3122956505"],"related_works":["https://openalex.org/W2360254753","https://openalex.org/W2277326438","https://openalex.org/W1499685530","https://openalex.org/W2125126715","https://openalex.org/W4365506312","https://openalex.org/W3144226417","https://openalex.org/W2105006450","https://openalex.org/W2018269848","https://openalex.org/W2392203420","https://openalex.org/W2031736545"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":8},{"year":2021,"cited_by_count":8},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":7},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":7},{"year":2015,"cited_by_count":10},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":7}],"updated_date":"2026-07-31T08:31:51.225901","created_date":"2025-10-10T00:00:00"}