{"id":"https://openalex.org/W2101073480","doi":"https://doi.org/10.1007/s10107-010-0343-0","title":"The hardness of routing two pairs on one face","display_name":"The hardness of routing two pairs on one face","publication_year":2010,"publication_date":"2010-03-08","ids":{"openalex":"https://openalex.org/W2101073480","doi":"https://doi.org/10.1007/s10107-010-0343-0","mag":"2101073480"},"language":"en","primary_location":{"id":"doi:10.1007/s10107-010-0343-0","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10107-010-0343-0","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":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/0911.3024","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5019615126","display_name":"Guyslain Naves","orcid":"https://orcid.org/0000-0001-5460-9995"},"institutions":[{"id":"https://openalex.org/I4210094718","display_name":"Laboratoire des Sciences pour la Conception, l'Optimisation et la Production","ror":"https://ror.org/00rv5x925","country_code":"FR","type":"facility","lineage":["https://openalex.org/I106785703","https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I4210094718","https://openalex.org/I4210159245","https://openalex.org/I899635006","https://openalex.org/I899635006"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Guyslain Naves","raw_affiliation_strings":["Laboratoire G-SCOP, 46, Avenue F\u00e9lix Viallet, 38031, Grenoble, Cedex, France","Laboratoire G-SCOP, 46, Avenue F\u00e9lix Viallet, 38031, Grenoble, Cedex, France#TAB#"],"affiliations":[{"raw_affiliation_string":"Laboratoire G-SCOP, 46, Avenue F\u00e9lix Viallet, 38031, Grenoble, Cedex, France","institution_ids":["https://openalex.org/I4210094718"]},{"raw_affiliation_string":"Laboratoire G-SCOP, 46, Avenue F\u00e9lix Viallet, 38031, Grenoble, Cedex, France#TAB#","institution_ids":["https://openalex.org/I4210094718"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5019615126"],"corresponding_institution_ids":["https://openalex.org/I4210094718"],"apc_list":{"value":2190,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":1.3775,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.82017904,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"131","issue":"1-2","first_page":"49","last_page":"69"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9991999864578247,"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"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9991999864578247,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9976999759674072,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9961000084877014,"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/arc-routing","display_name":"Arc routing","score":0.7099702954292297},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.698098361492157},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6930884122848511},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.6493006944656372},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.5770773887634277},{"id":"https://openalex.org/keywords/polyhedron","display_name":"Polyhedron","score":0.5541764497756958},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4835200309753418},{"id":"https://openalex.org/keywords/directed-acyclic-graph","display_name":"Directed acyclic graph","score":0.47481977939605713},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4336247444152832},{"id":"https://openalex.org/keywords/face","display_name":"Face (sociological concept)","score":0.4161722660064697},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.41375240683555603},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.40829336643218994},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.35314518213272095},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.1690770983695984},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.12775883078575134}],"concepts":[{"id":"https://openalex.org/C2778536092","wikidata":"https://www.wikidata.org/wiki/Q4785038","display_name":"Arc routing","level":3,"score":0.7099702954292297},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.698098361492157},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6930884122848511},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.6493006944656372},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.5770773887634277},{"id":"https://openalex.org/C54829058","wikidata":"https://www.wikidata.org/wiki/Q172937","display_name":"Polyhedron","level":2,"score":0.5541764497756958},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4835200309753418},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.47481977939605713},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4336247444152832},{"id":"https://openalex.org/C2779304628","wikidata":"https://www.wikidata.org/wiki/Q3503480","display_name":"Face (sociological concept)","level":2,"score":0.4161722660064697},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.41375240683555603},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.40829336643218994},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.35314518213272095},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.1690770983695984},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.12775883078575134},{"id":"https://openalex.org/C144024400","wikidata":"https://www.wikidata.org/wiki/Q21201","display_name":"Sociology","level":0,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C36289849","wikidata":"https://www.wikidata.org/wiki/Q34749","display_name":"Social science","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/s10107-010-0343-0","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10107-010-0343-0","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:arXiv.org:0911.3024","is_oa":true,"landing_page_url":"http://arxiv.org/abs/0911.3024","pdf_url":"https://arxiv.org/pdf/0911.3024","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:HAL:hal-00313944v2","is_oa":true,"landing_page_url":"https://hal.science/hal-00313944","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Mathematical Programming, Series A, 2012, 131 (1 - 2), pp.49 - 69. ⟨10.1007/s10107-010-0343-0⟩","raw_type":"Journal articles"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:0911.3024","is_oa":true,"landing_page_url":"http://arxiv.org/abs/0911.3024","pdf_url":"https://arxiv.org/pdf/0911.3024","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W976211528","https://openalex.org/W1563039933","https://openalex.org/W2005079828","https://openalex.org/W2012969943","https://openalex.org/W2017713020","https://openalex.org/W2030101236","https://openalex.org/W2055564944","https://openalex.org/W2062577352","https://openalex.org/W2988480584"],"related_works":["https://openalex.org/W2146569528","https://openalex.org/W4214487273","https://openalex.org/W4287028074","https://openalex.org/W2106828717","https://openalex.org/W3191289342","https://openalex.org/W1998712144","https://openalex.org/W3164774158","https://openalex.org/W2372211403","https://openalex.org/W4297817344","https://openalex.org/W1498463151"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}