{"id":"https://openalex.org/W4375948387","doi":"https://doi.org/10.1142/s0129054123410058","title":"On the Shared Transportation Problem: Computational Hardness and Exact Approach","display_name":"On the Shared Transportation Problem: Computational Hardness and Exact Approach","publication_year":2023,"publication_date":"2023-05-09","ids":{"openalex":"https://openalex.org/W4375948387","doi":"https://doi.org/10.1142/s0129054123410058"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054123410058","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1142/s0129054123410058","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://utc.hal.science/hal-04097811/document","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5083561554","display_name":"Tom Davot","orcid":"https://orcid.org/0000-0003-4203-5140"},"institutions":[{"id":"https://openalex.org/I102516824","display_name":"Universit\u00e9 de Technologie de Compi\u00e8gne","ror":"https://ror.org/04y5kwa70","country_code":"FR","type":"education","lineage":["https://openalex.org/I102516824"]},{"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/I4210088387","display_name":"Heuristics and Diagnostics for Complex Systems","ror":"https://ror.org/0075hvk77","country_code":"FR","type":"facility","lineage":["https://openalex.org/I102516824","https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I4210088387","https://openalex.org/I4210159245"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Tom Davot","raw_affiliation_strings":["Universit\u00e9 de Technologie de Compi\u00e8gne, CNRS, Heudiasyc, (Heuristics and Diagnosis of Complex Systems), CS 60 319 - 60 203 Compi\u00e8gne Cedex, France","Heudiasyc - Heuristique et Diagnostic des Syst\u00e8mes Complexes [Compi\u00e8gne] (UTC, CS 60319 - 57 avenue de Landshut - 60203 Compi\u00e8gne cedex - France)","Labex MS2T - Laboratoire d'Excellence 'Ma\u00eetrise des Syst\u00e8mes de Syst\u00e8mes Technologiques' (Universit\u00e9 de Technologie de Compi\u00e8gne - Centre de Recherche de Royallieu - rue du Docteur Schweitzer- CS 60319 - 60203 COMPIEGNE Cedex - France)"],"affiliations":[{"raw_affiliation_string":"Universit\u00e9 de Technologie de Compi\u00e8gne, CNRS, Heudiasyc, (Heuristics and Diagnosis of Complex Systems), CS 60 319 - 60 203 Compi\u00e8gne Cedex, France","institution_ids":["https://openalex.org/I102516824","https://openalex.org/I4210088387","https://openalex.org/I1294671590"]},{"raw_affiliation_string":"Heudiasyc - Heuristique et Diagnostic des Syst\u00e8mes Complexes [Compi\u00e8gne] (UTC, CS 60319 - 57 avenue de Landshut - 60203 Compi\u00e8gne cedex - France)","institution_ids":["https://openalex.org/I4210088387","https://openalex.org/I102516824"]},{"raw_affiliation_string":"Labex MS2T - Laboratoire d'Excellence 'Ma\u00eetrise des Syst\u00e8mes de Syst\u00e8mes Technologiques' (Universit\u00e9 de Technologie de Compi\u00e8gne - Centre de Recherche de Royallieu - rue du Docteur Schweitzer- CS 60319 - 60203 COMPIEGNE Cedex - France)","institution_ids":["https://openalex.org/I102516824"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5062572546","display_name":"Rodolphe Giroudeau","orcid":"https://orcid.org/0000-0002-6756-2361"},"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/I4210101743","display_name":"Laboratoire d'Informatique, de Robotique et de Micro\u00e9lectronique de Montpellier","ror":"https://ror.org/013yean28","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I151295451","https://openalex.org/I19894307","https://openalex.org/I4210101743","https://openalex.org/I4210159245","https://openalex.org/I4405261681"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Rodolphe Giroudeau","raw_affiliation_strings":["LIRMM - CNRS UMR 5506 - Montpellier, France","LIRMM | MAORE - Methods, Algorithms for Operations REsearch (LIRMM, 161 rue Ada, 34000 Montpellier - France)"],"affiliations":[{"raw_affiliation_string":"LIRMM - CNRS UMR 5506 - Montpellier, France","institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I4210101743"]},{"raw_affiliation_string":"LIRMM | MAORE - Methods, Algorithms for Operations REsearch (LIRMM, 161 rue Ada, 34000 Montpellier - France)","institution_ids":["https://openalex.org/I4210101743"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5110855641","display_name":"Jean\u2010Claude K\u00f6nig","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/I4210101743","display_name":"Laboratoire d'Informatique, de Robotique et de Micro\u00e9lectronique de Montpellier","ror":"https://ror.org/013yean28","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I151295451","https://openalex.org/I19894307","https://openalex.org/I4210101743","https://openalex.org/I4210159245","https://openalex.org/I4405261681"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Jean-Claude K\u00f6nig","raw_affiliation_strings":["LIRMM - CNRS UMR 5506 - Montpellier, France","LIRMM | MAORE - Methods, Algorithms for Operations REsearch (LIRMM, 161 rue Ada, 34000 Montpellier - France)"],"affiliations":[{"raw_affiliation_string":"LIRMM - CNRS UMR 5506 - Montpellier, France","institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I4210101743"]},{"raw_affiliation_string":"LIRMM | MAORE - Methods, Algorithms for Operations REsearch (LIRMM, 161 rue Ada, 34000 Montpellier - France)","institution_ids":["https://openalex.org/I4210101743"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5083561554"],"corresponding_institution_ids":["https://openalex.org/I102516824","https://openalex.org/I1294671590","https://openalex.org/I4210088387"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.05545531,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"16"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.9368000030517578,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.9368000030517578,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9125000238418579,"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/time-complexity","display_name":"Time complexity","score":0.6115301251411438},{"id":"https://openalex.org/keywords/completeness","display_name":"Completeness (order theory)","score":0.5507411360740662},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.540996789932251},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5195284485816956},{"id":"https://openalex.org/keywords/trips-architecture","display_name":"TRIPS architecture","score":0.5124438405036926},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4920296370983124},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4911060333251953},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4583525061607361},{"id":"https://openalex.org/keywords/hardness-of-approximation","display_name":"Hardness of approximation","score":0.4360513687133789},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.40898656845092773},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.37745171785354614},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3598383069038391},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3529619872570038},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.23724353313446045}],"concepts":[{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6115301251411438},{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.5507411360740662},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.540996789932251},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5195284485816956},{"id":"https://openalex.org/C157085824","wikidata":"https://www.wikidata.org/wiki/Q2384809","display_name":"TRIPS architecture","level":2,"score":0.5124438405036926},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4920296370983124},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4911060333251953},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4583525061607361},{"id":"https://openalex.org/C112955886","wikidata":"https://www.wikidata.org/wiki/Q5656275","display_name":"Hardness of approximation","level":3,"score":0.4360513687133789},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.40898656845092773},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.37745171785354614},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3598383069038391},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3529619872570038},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.23724353313446045},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1142/s0129054123410058","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1142/s0129054123410058","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:HAL:hal-04097811v1","is_oa":true,"landing_page_url":"https://utc.hal.science/hal-04097811","pdf_url":"https://utc.hal.science/hal-04097811/document","source":{"id":"https://openalex.org/S4406922466","display_name":"SPIRE - Sciences Po Institutional REpository","issn_l":null,"issn":null,"is_oa":false,"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":"International Journal of Foundations of Computer Science, 2024, 35 (6), pp.741-756. ⟨10.1142/S0129054123410058⟩","raw_type":"Journal articles"}],"best_oa_location":{"id":"pmh:oai:HAL:hal-04097811v1","is_oa":true,"landing_page_url":"https://utc.hal.science/hal-04097811","pdf_url":"https://utc.hal.science/hal-04097811/document","source":{"id":"https://openalex.org/S4406922466","display_name":"SPIRE - Sciences Po Institutional REpository","issn_l":null,"issn":null,"is_oa":false,"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":"International Journal of Foundations of Computer Science, 2024, 35 (6), pp.741-756. ⟨10.1142/S0129054123410058⟩","raw_type":"Journal articles"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1404270698","display_name":null,"funder_award_id":"NR-11-IDEX-0004-02","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"},{"id":"https://openalex.org/G4009746975","display_name":null,"funder_award_id":"ANR-11-IDEX-0004-02","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"},{"id":"https://openalex.org/G4866930200","display_name":null,"funder_award_id":"ANR-11-IDEX","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"},{"id":"https://openalex.org/G5003875507","display_name":null,"funder_award_id":"-11-IDEX-0004-02","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"},{"id":"https://openalex.org/G5615659713","display_name":null,"funder_award_id":"IDEX-0004-02","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"},{"id":"https://openalex.org/G6182026652","display_name":null,"funder_award_id":"11-IDEX-0004","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"},{"id":"https://openalex.org/G6246589203","display_name":null,"funder_award_id":"11-IDEX-0004-02","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"},{"id":"https://openalex.org/G6654833908","display_name":null,"funder_award_id":"ANR-11-IDEX-0004","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"},{"id":"https://openalex.org/G7823808512","display_name":null,"funder_award_id":"ANR-11-IDEX-000","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"},{"id":"https://openalex.org/G846706564","display_name":null,"funder_award_id":"ANR-11-IDEX-0004-0","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"}],"funders":[{"id":"https://openalex.org/F4320320883","display_name":"Agence Nationale de la Recherche","ror":"https://ror.org/00rbzpz17"},{"id":"https://openalex.org/F4320338463","display_name":"CHIST-ERA","ror":"https://ror.org/00rbzpz17"}],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W4375948387.pdf"},"referenced_works_count":20,"referenced_works":["https://openalex.org/W1582649504","https://openalex.org/W1684108869","https://openalex.org/W1909158042","https://openalex.org/W1980402561","https://openalex.org/W2001366300","https://openalex.org/W2017383000","https://openalex.org/W2031128290","https://openalex.org/W2051100691","https://openalex.org/W2079473728","https://openalex.org/W2084224084","https://openalex.org/W2095481180","https://openalex.org/W2163599294","https://openalex.org/W2249739104","https://openalex.org/W2569797005","https://openalex.org/W2595601445","https://openalex.org/W2792987450","https://openalex.org/W2907565004","https://openalex.org/W2914414140","https://openalex.org/W2917278327","https://openalex.org/W3009318933"],"related_works":["https://openalex.org/W2131810278","https://openalex.org/W2307719096","https://openalex.org/W1561811279","https://openalex.org/W2962917430","https://openalex.org/W2028468530","https://openalex.org/W2963411648","https://openalex.org/W2952838392","https://openalex.org/W4299801389","https://openalex.org/W2016001296","https://openalex.org/W2019123979"],"abstract_inverted_index":{"In":[0],"our":[1],"modern":[2],"societies,":[3],"a":[4,12,64,71,126,138,143],"certain":[5],"number":[6,91,98],"of":[7,73,92,99,113],"people":[8,40],"do":[9],"not":[10],"own":[11],"car,":[13],"by":[14,17,45,80],"choice":[15],"or":[16,25],"obligation.":[18],"For":[19],"some":[20],"trips,":[21],"there":[22],"is":[23,41,70],"no":[24],"few":[26],"alternatives":[27],"to":[28,33,42,55],"the":[29,74,90,97,104,107,133],"car.":[30],"One":[31],"way":[32],"make":[34],"these":[35,39],"trips":[36],"possible":[37],"for":[38,103,129],"be":[43],"transported":[44],"others":[46],"who":[47],"have":[48],"already":[49],"planned":[50],"their":[51],"trips.":[52],"We":[53,84,101,123],"propose":[54,125],"model":[56],"this":[57],"problem":[58,62,69],"using":[59],"as":[60],"path-finding":[61],"in":[63,120],"list":[65],"edge-colored":[66],"graph.":[67],"This":[68],"generalization":[72],"[Formula:":[75],"see":[76],"text]-path":[77],"problem,":[78],"studied":[79],"B\u00f6hmov\u00e1":[81],"et":[82],"al.":[83],"consider":[85],"two":[86],"optimization":[87],"functions:":[88],"minimizing":[89,96],"color":[93],"changes":[94],"and":[95,115,142],"colors.":[100],"study":[102],"previous":[105],"problems,":[106],"classic":[108],"complexity":[109,117],"(polynomial-case,":[110],"NP-completeness,":[111],"hardness":[112],"approximation)":[114],"parameter":[116],"(W[2]-hardness)":[118],"even":[119],"restricted":[121],"cases.":[122],"also":[124],"lower":[127],"bound":[128],"exact":[130],"algorithm.":[131,145],"On":[132],"positive":[134],"side":[135],"we":[136],"provide":[137],"polynomial-time":[139],"approximation":[140],"algorithm":[141],"FPT":[144]},"counts_by_year":[],"updated_date":"2026-04-18T07:56:08.524223","created_date":"2025-10-10T00:00:00"}