{"id":"https://openalex.org/W2018781529","doi":"https://doi.org/10.1007/s10107-006-0060-x","title":"On the graphical relaxation of the symmetric traveling salesman polytope","display_name":"On the graphical relaxation of the symmetric traveling salesman polytope","publication_year":2006,"publication_date":"2006-12-14","ids":{"openalex":"https://openalex.org/W2018781529","doi":"https://doi.org/10.1007/s10107-006-0060-x","mag":"2018781529"},"language":"en","primary_location":{"id":"doi:10.1007/s10107-006-0060-x","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10107-006-0060-x","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/A5084196031","display_name":"Marcus Oswald","orcid":"https://orcid.org/0000-0002-0740-7343"},"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":false,"raw_author_name":"Marcus Oswald","raw_affiliation_strings":["Institute for Computer Science, University of Heidelberg, Im Neuenheimer Feld 368, 69120, Heidelberg, Germany","University of Heidelberg, Institute for Computer Science, Im Neuenheimer Feld 368, 69120, Heidelberg, Germany#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute for Computer Science, University of Heidelberg, Im Neuenheimer Feld 368, 69120, Heidelberg, Germany","institution_ids":["https://openalex.org/I223822909"]},{"raw_affiliation_string":"University of Heidelberg, Institute for Computer Science, Im Neuenheimer Feld 368, 69120, Heidelberg, Germany#TAB#","institution_ids":["https://openalex.org/I223822909"]}]},{"author_position":"middle","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":false,"raw_author_name":"Gerhard Reinelt","raw_affiliation_strings":["Institute for Computer Science, University of Heidelberg, Im Neuenheimer Feld 368, 69120, Heidelberg, Germany","University of Heidelberg, Institute for Computer Science, Im Neuenheimer Feld 368, 69120, Heidelberg, Germany#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute for Computer Science, University of Heidelberg, Im Neuenheimer Feld 368, 69120, Heidelberg, Germany","institution_ids":["https://openalex.org/I223822909"]},{"raw_affiliation_string":"University of Heidelberg, Institute for Computer Science, Im Neuenheimer Feld 368, 69120, Heidelberg, Germany#TAB#","institution_ids":["https://openalex.org/I223822909"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5070611630","display_name":"Dirk Oliver Theis","orcid":"https://orcid.org/0000-0002-9362-0748"},"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":false,"raw_author_name":"Dirk Oliver Theis","raw_affiliation_strings":["Institute for Computer Science, University of Heidelberg, Im Neuenheimer Feld 368, 69120, Heidelberg, Germany","University of Heidelberg, Institute for Computer Science, Im Neuenheimer Feld 368, 69120, Heidelberg, Germany#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute for Computer Science, University of Heidelberg, Im Neuenheimer Feld 368, 69120, Heidelberg, Germany","institution_ids":["https://openalex.org/I223822909"]},{"raw_affiliation_string":"University of Heidelberg, Institute for Computer Science, Im Neuenheimer Feld 368, 69120, Heidelberg, Germany#TAB#","institution_ids":["https://openalex.org/I223822909"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":2190,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":4.0998,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.92505678,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"110","issue":"1","first_page":"175","last_page":"193"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9954000115394592,"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.9954000115394592,"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.9847999811172485,"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/T11797","display_name":"graph theory and CDMA systems","score":0.9243000149726868,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic 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/polyhedron","display_name":"Polyhedron","score":0.9158798456192017},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.85505610704422},{"id":"https://openalex.org/keywords/polytope","display_name":"Polytope","score":0.8122304677963257},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.795179009437561},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7010437250137329},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6450375914573669},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.5040263533592224},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.4455236494541168},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.24207213521003723},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.21638551354408264},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.21503087878227234}],"concepts":[{"id":"https://openalex.org/C54829058","wikidata":"https://www.wikidata.org/wiki/Q172937","display_name":"Polyhedron","level":2,"score":0.9158798456192017},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.85505610704422},{"id":"https://openalex.org/C145691206","wikidata":"https://www.wikidata.org/wiki/Q747980","display_name":"Polytope","level":2,"score":0.8122304677963257},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.795179009437561},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7010437250137329},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6450375914573669},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.5040263533592224},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.4455236494541168},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.24207213521003723},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.21638551354408264},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.21503087878227234},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s10107-006-0060-x","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10107-006-0060-x","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W42326245","https://openalex.org/W201222650","https://openalex.org/W307896644","https://openalex.org/W1230639052","https://openalex.org/W1576649545","https://openalex.org/W1586016561","https://openalex.org/W1652378708","https://openalex.org/W1963547452","https://openalex.org/W1964127155","https://openalex.org/W1975467430","https://openalex.org/W1981894795","https://openalex.org/W2020163691","https://openalex.org/W2021199373","https://openalex.org/W2021659530","https://openalex.org/W2033662447","https://openalex.org/W2058937865","https://openalex.org/W2067684024","https://openalex.org/W2069255695","https://openalex.org/W2073906627","https://openalex.org/W2083210138","https://openalex.org/W2110771610","https://openalex.org/W2141917808","https://openalex.org/W2287176450","https://openalex.org/W2399100674","https://openalex.org/W2476944423","https://openalex.org/W2595872155","https://openalex.org/W4213103105","https://openalex.org/W4285719527","https://openalex.org/W6655913904"],"related_works":["https://openalex.org/W175452553","https://openalex.org/W2184834902","https://openalex.org/W2183097989","https://openalex.org/W2952452737","https://openalex.org/W2241463327","https://openalex.org/W4300637737","https://openalex.org/W2038458261","https://openalex.org/W2105006450","https://openalex.org/W1579502333","https://openalex.org/W2044119054"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}