{"id":"https://openalex.org/W2137045485","doi":"https://doi.org/10.1023/a:1008779125567","title":"A Branch & Cut Algorithm for the Asymmetric Traveling Salesman Problem with Precedence Constraints","display_name":"A Branch & Cut Algorithm for the Asymmetric Traveling Salesman Problem with Precedence Constraints","publication_year":2000,"publication_date":"2000-10-01","ids":{"openalex":"https://openalex.org/W2137045485","doi":"https://doi.org/10.1023/a:1008779125567","mag":"2137045485"},"language":"en","primary_location":{"id":"doi:10.1023/a:1008779125567","is_oa":false,"landing_page_url":"https://doi.org/10.1023/a:1008779125567","pdf_url":null,"source":{"id":"https://openalex.org/S39243548","display_name":"Computational Optimization and Applications","issn_l":"0926-6003","issn":["0926-6003","1573-2894"],"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":"Computational Optimization and Applications","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/A5047049850","display_name":"Norbert Ascheuer","orcid":null},"institutions":[{"id":"https://openalex.org/I195893171","display_name":"Zuse Institute Berlin","ror":"https://ror.org/02eva5865","country_code":"DE","type":"facility","lineage":["https://openalex.org/I195893171"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Norbert Ascheuer","raw_affiliation_strings":["Konrad-Zuse-Zentrum f\u00fcr Informationstechnik Berlin, Berlin-Dahlem, Germany","Konrad-Zuse-Zentrum f\u00fcr Informationstechnik Berlin, Takustr. 7, D-14195, Berlin-Dahlem, Germany","Konrad-Zuse-Zentrum f\u00fcr Informationstechnik Berlin, Takustr. 7, D-14195 Berlin-Dahlem, Germany. ascheuer@intranetz.de#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Konrad-Zuse-Zentrum f\u00fcr Informationstechnik Berlin, Berlin-Dahlem, Germany","institution_ids":["https://openalex.org/I195893171"]},{"raw_affiliation_string":"Konrad-Zuse-Zentrum f\u00fcr Informationstechnik Berlin, Takustr. 7, D-14195, Berlin-Dahlem, Germany","institution_ids":["https://openalex.org/I195893171"]},{"raw_affiliation_string":"Konrad-Zuse-Zentrum f\u00fcr Informationstechnik Berlin, Takustr. 7, D-14195 Berlin-Dahlem, Germany. ascheuer@intranetz.de#TAB#","institution_ids":["https://openalex.org/I195893171"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5016595075","display_name":"Michael J\u00fcnger","orcid":"https://orcid.org/0000-0002-7574-6646"},"institutions":[{"id":"https://openalex.org/I180923762","display_name":"University of Cologne","ror":"https://ror.org/00rcxh774","country_code":"DE","type":"education","lineage":["https://openalex.org/I180923762"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Michael J\u00fcnger","raw_affiliation_strings":["Institut f\u00fcr Informatik der Universit\u00e4t zu K\u00f6ln, K\u00f6ln, Germany","Institut f\u00fcr Informatik der Universit\u00e4t zu K\u00f6ln, Pohligstr. 1, D-50969, K\u00f6ln, Germany","Institut f\u00fcr Informatik der Universit\u00e4t zu K\u00f6ln, Pohligstr. 1, D-50969 K\u00f6ln, Germany. mjuenger@informatik.uni-koeln.de#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Informatik der Universit\u00e4t zu K\u00f6ln, K\u00f6ln, Germany","institution_ids":["https://openalex.org/I180923762"]},{"raw_affiliation_string":"Institut f\u00fcr Informatik der Universit\u00e4t zu K\u00f6ln, Pohligstr. 1, D-50969, K\u00f6ln, Germany","institution_ids":["https://openalex.org/I180923762"]},{"raw_affiliation_string":"Institut f\u00fcr Informatik der Universit\u00e4t zu K\u00f6ln, Pohligstr. 1, D-50969 K\u00f6ln, Germany. mjuenger@informatik.uni-koeln.de#TAB#","institution_ids":["https://openalex.org/I180923762"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5000892313","display_name":"Gerhard Reinelt","orcid":"https://orcid.org/0000-0002-7193-501X"},"institutions":[{"id":"https://openalex.org/I223822909","display_name":"Heidelberg University","ror":"https://ror.org/038t36y30","country_code":"DE","type":"education","lineage":["https://openalex.org/I223822909"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Gerhard Reinelt","raw_affiliation_strings":["Institut f\u00fcr Angewandte Mathematik, Universit\u00e4t Heidelberg, Germany","Institut f\u00fcr Angewandte Mathematik, Universit\u00e4t Heidelberg, Im Neuenheimer Feld 293, D-69120, Heidelberg, Germany","Institut f\u00fcr Angewandte Mathematik, Universit\u00e4t Heidelberg, Im Neuenheimer Feld 293, D-69120 Heidelberg, Germany.  gerhard.reinelt@IWR.Uni-Heidelberg.De"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Angewandte Mathematik, Universit\u00e4t Heidelberg, Germany","institution_ids":["https://openalex.org/I223822909"]},{"raw_affiliation_string":"Institut f\u00fcr Angewandte Mathematik, Universit\u00e4t Heidelberg, Im Neuenheimer Feld 293, D-69120, Heidelberg, Germany","institution_ids":["https://openalex.org/I223822909"]},{"raw_affiliation_string":"Institut f\u00fcr Angewandte Mathematik, Universit\u00e4t Heidelberg, Im Neuenheimer Feld 293, D-69120 Heidelberg, Germany.  gerhard.reinelt@IWR.Uni-Heidelberg.De","institution_ids":["https://openalex.org/I223822909"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5000892313","https://openalex.org/A5016595075","https://openalex.org/A5047049850"],"corresponding_institution_ids":["https://openalex.org/I180923762","https://openalex.org/I195893171","https://openalex.org/I223822909"],"apc_list":{"value":2990,"currency":"USD","value_usd":2990},"apc_paid":null,"fwci":12.1551,"has_fulltext":false,"cited_by_count":127,"citation_normalized_percentile":{"value":0.98640641,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":96,"max":99},"biblio":{"volume":"17","issue":"1","first_page":"61","last_page":"84"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9998000264167786,"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.9998000264167786,"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.9997000098228455,"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9990000128746033,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.8289309740066528},{"id":"https://openalex.org/keywords/branch-and-cut","display_name":"Branch and cut","score":0.6715368032455444},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5808081030845642},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.5793027877807617},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5683292150497437},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5323021411895752},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.5279675722122192},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5181897282600403},{"id":"https://openalex.org/keywords/vehicle-routing-problem","display_name":"Vehicle routing problem","score":0.48910313844680786},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4196867346763611},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3874431550502777},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2548181414604187}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.8289309740066528},{"id":"https://openalex.org/C50797617","wikidata":"https://www.wikidata.org/wiki/Q498566","display_name":"Branch and cut","level":3,"score":0.6715368032455444},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5808081030845642},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.5793027877807617},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5683292150497437},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5323021411895752},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.5279675722122192},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5181897282600403},{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.48910313844680786},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4196867346763611},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3874431550502777},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2548181414604187},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1023/a:1008779125567","is_oa":false,"landing_page_url":"https://doi.org/10.1023/a:1008779125567","pdf_url":null,"source":{"id":"https://openalex.org/S39243548","display_name":"Computational Optimization and Applications","issn_l":"0926-6003","issn":["0926-6003","1573-2894"],"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":"Computational Optimization and Applications","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5,"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W126325332","https://openalex.org/W307896644","https://openalex.org/W1548993723","https://openalex.org/W1727402993","https://openalex.org/W1964651230","https://openalex.org/W1978038344","https://openalex.org/W1991119408","https://openalex.org/W1994184140","https://openalex.org/W2005944337","https://openalex.org/W2015411837","https://openalex.org/W2018474648","https://openalex.org/W2023721044","https://openalex.org/W2033789385","https://openalex.org/W2072408652","https://openalex.org/W2084340826","https://openalex.org/W2091873169","https://openalex.org/W2123805664","https://openalex.org/W2163428398","https://openalex.org/W2400401042","https://openalex.org/W3011648644","https://openalex.org/W3124681150","https://openalex.org/W4285719527","https://openalex.org/W6605129799"],"related_works":["https://openalex.org/W2769220156","https://openalex.org/W3006617646","https://openalex.org/W2009796757","https://openalex.org/W4210880521","https://openalex.org/W2046300504","https://openalex.org/W2734758384","https://openalex.org/W2953793234","https://openalex.org/W2263874601","https://openalex.org/W4223947110","https://openalex.org/W1968202374"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":7},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":7},{"year":2019,"cited_by_count":7},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":6},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":7}],"updated_date":"2026-07-23T08:03:31.855105","created_date":"2016-06-24T00:00:00"}