{"id":"https://openalex.org/W3154875263","doi":null,"title":"Polynomial subcases of the home health care routing and scheduling problem with \ufb01xed services","display_name":"Polynomial subcases of the home health care routing and scheduling problem with \ufb01xed services","alternate_titles":[],"publication_year":2018,"publication_date":"2018-01-01","ids":{"openalex":"https://openalex.org/W3154875263","mag":"3154875263"},"language":"en","primary_location":{"id":"pmh:oai:HAL:hal-01870962v1","doi":null,"is_oa":false,"landing_page_url":"https://hal.science/hal-01870962","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I4405252976","host_organization_name":"Centre pour la Communication Scientifique Directe","host_organization_lineage":["https://openalex.org/I4405252976"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"European Chapter on Combinatorial Optimization, 2018, Fribourg, Switzerland","raw_type":"info:eu-repo/semantics/conferenceObject"},"parent_works":[],"lineage":["https://openalex.org/W3154875263"],"child_works_count":0,"type":"conference-paper","is_traditional":true,"indexed_in":[],"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/A5049580216","display_name":"Cl\u00e9a Martinez","orcid":"https://orcid.org/0000-0002-6390-0001","observed_orcids":["https://orcid.org/0000-0002-6390-0001"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Martinez, Clea","raw_affiliation_strings":["Recherche Op\u00e9rationnelle pour les Syst\u00e8mes de Production"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Recherche Op\u00e9rationnelle pour les Syst\u00e8mes de Production","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5069008839","display_name":"Marie\u2010Laure Espinouse","orcid":"https://orcid.org/0000-0003-0120-661X","observed_orcids":["https://orcid.org/0000-0003-0120-661X"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Espinouse, Marie-Laure","raw_affiliation_strings":["Recherche Op\u00e9rationnelle pour les Syst\u00e8mes de Production"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Recherche Op\u00e9rationnelle pour les Syst\u00e8mes de Production","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5007229078","display_name":"Maria Di Mascolo","orcid":"https://orcid.org/0000-0002-8784-9685","observed_orcids":["https://orcid.org/0000-0002-8784-9685"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Di Mascolo, Maria","raw_affiliation_strings":["Gestion et Conduite des Syst\u00e8mes de Production"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Gestion et Conduite des Syst\u00e8mes de Production","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.7529,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.62717725,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":92,"max":94},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9945999979972839,"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.9945999979972839,"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/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.003100000089034438,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T11502","display_name":"Facility Location and Emergency Management","score":0.00039999998989515007,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/interval-graphs","display_name":"interval graphs","score":0.7749999761581421},{"id":"https://openalex.org/keywords/chordal-graphs","display_name":"chordal graphs","score":0.8230000138282776},{"id":"https://openalex.org/keywords/perfect-elimination-orderings","display_name":"perfect elimination orderings","score":0.8389999866485596},{"id":"https://openalex.org/keywords/greedy-coloring","display_name":"greedy coloring","score":0.7549999952316284},{"id":"https://openalex.org/keywords/comparability-graphs","display_name":"comparability graphs","score":0.9409999847412109},{"id":"https://openalex.org/keywords/transitive-orientation","display_name":"transitive orientation","score":0.9800000190734863},{"id":"https://openalex.org/keywords/dilworth-s-theorem","display_name":"Dilworth's theorem","score":0.9399999976158142},{"id":"https://openalex.org/keywords/chain-decomposition","display_name":"chain decomposition","score":0.7319999933242798},{"id":"https://openalex.org/keywords/polynomial-time-algorithms","display_name":"polynomial-time algorithms","score":0.5149999856948853},{"id":"https://openalex.org/keywords/travel-time","display_name":"travel time","score":0.5230000019073486},{"id":"https://openalex.org/keywords/triangle-inequality","display_name":"triangle inequality","score":0.8650000095367432},{"id":"https://openalex.org/keywords/graph-coloring","display_name":"graph coloring","score":0.3490000069141388},{"id":"https://openalex.org/keywords/graph-partitioning","display_name":"graph partitioning","score":0.492000013589859},{"id":"https://openalex.org/keywords/np-hard-problems","display_name":"NP-hard problems","score":0.4620000123977661},{"id":"https://openalex.org/keywords/vehicle-routing-problem","display_name":"vehicle routing","score":0.3779999911785126}],"concepts":[{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6699342131614685},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6392694711685181},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.5847804546356201},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.46800652146339417},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4234878420829773},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.4134008288383484},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.36977750062942505},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3192438781261444},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.2533301115036011},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23401889204978943},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.18040472269058228}],"mesh":[],"locations_count":1,"locations":[{"id":"pmh:oai:HAL:hal-01870962v1","doi":null,"is_oa":false,"landing_page_url":"https://hal.science/hal-01870962","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I4405252976","host_organization_name":"Centre pour la Communication Scientifique Directe","host_organization_lineage":["https://openalex.org/I4405252976"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"European Chapter on Combinatorial Optimization, 2018, Fribourg, Switzerland","raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2966301493","https://openalex.org/W2810258123","https://openalex.org/W4377694813","https://openalex.org/W2729401091","https://openalex.org/W6962798201","https://openalex.org/W4411276860","https://openalex.org/W6960283495","https://openalex.org/W2076567726","https://openalex.org/W2958269518","https://openalex.org/W4389916599"],"abstract_inverted_index":{"In":[0],"home":[1,226],"services":[2,147,227,381],"agencies,":[3],"planners":[4],"are":[5,148,211,270,281,343],"in":[6,95,213,228,231,292,346,382,406,495,521],"charge":[7],"of":[8,43,89,106,132,145,195,216,240,290,309,322,328,365,397,418,421,430,488],"scheduling":[9],"and":[10,28,32,35,83,109,128,142,164,187,249,350,374,399,450,458,478,490],"routing":[11],"caregivers":[12,158,196,431],"to":[13,16,115,181,191,198,301,314,425,433,502,512,518],"clients\u2019":[14],"homes":[15],"provide":[17,199],"services.":[18,254,437],"This":[19],"problem":[20,60,153,471],"is":[21,37,61,190,221,261,313,334,370,424],"called":[22],"the":[23,90,107,130,139,146,152,161,193,201,214,217,223,236,241,244,247,250,310,319,331,338,347,353,358,363,366,377,416,419,427,436,440,473,481,485],"Home":[24],"Health":[25],"Care":[26],"Routing":[27],"Scheduling":[29],"Problem":[30],"(Cheng":[31],"Rich,":[33],"1998)":[34],"it":[36,67,220,508],"usually":[38],"treated":[39],"as":[40,50,79,219],"a":[41,44,120,125,266,273,286,297,306,316,371,395,403,443,448,451,468,496],"variant":[42],"VRP":[45],"with":[46,68,318,330,384,472],"speci\ufb01c":[47,121],"constraints":[48,516],"such":[49,78,324],"time":[51,173],"windows,":[52],"legal":[53],"regulations":[54],"or":[55,74,175],"skill":[56,176],"requirements.":[57],"Obviously,":[58],"this":[59,302],"NP-hard":[62],"so":[63,507],"most":[64],"papers":[65],"address":[66],"matheuristics":[69],"(Decerle":[70],"et":[71,97,135],"al.,":[72],"2016)":[73],"other":[75],"optimization":[76],"methods":[77],"branch-price-and-cut":[80],"algorithms":[81],"(Trautsamwieser":[82],"Hirsch,":[84],"2011).":[85],"An":[86],"exhaustive":[87],"review":[88],"topic":[91],"can":[92,284,388,401,466,500],"be":[93,182,510],"found":[94],"Cisse":[96],"al.":[98,136],"(2017).We":[99],"will":[100],"focus":[101],"on":[102,455,461],"two":[103],"polynomial":[104,293,475],"subcases":[105],"HHCRSP,":[108],"use":[110],"tools":[111],"from":[112,160],"graph":[113,238,368,396,441],"theory":[114],"solve":[116,467],"them.":[117],"We":[118,150,255,361,387,438],"study":[119],"case":[122,127,224],"inspired":[123],"by":[124,129,154,184,446],"real":[126],"work":[131,519],"Di":[133],"Mascolo":[134],"(2017)":[137],"where":[138,243],"starting":[140],"times":[141,144,210,342,494],"ending":[143],"\ufb01xed.":[149],"simplify":[151],"considering":[155],"that":[156,208,257,312,325,355,391,423],"all":[157,200,435],"start":[159],"same":[162,332],"depot,":[163],"we":[165,206,269,283,304,351,375,392,400,465,479],"do":[166],"not":[167,344],"take":[168,513],"into":[169,442,514],"account":[170,515],"any":[171,258],"working":[172],"regulation":[174,520],"requirement.":[177],"Every":[178],"service":[179],"needs":[180],"performed":[183],"one":[185],"careworker":[186],"our":[188,203],"goal":[189],"minimize":[192],"number":[194,321,429,487],"needed":[197,432],"services.In":[202],"\ufb01rst":[204],"subcase,":[205],"consider":[207,235,362],"traveling":[209,341,385,493],"included":[212,345],"duration":[215],"task,":[218],"often":[222],"for":[225,265,272],"France,":[229],"especially":[230],"urban":[232],"areas.":[233],"Let\u2019s":[234],"interval":[237,279,367],"G(V,E)":[239],"problem,":[242,340],"vertices":[245,329],"represent":[246],"services,":[248],"edges":[251,378],"join":[252],"overlapping":[253],"notice":[256],"independant":[259],"set":[260,276,327,420],"an":[262,335],"admissible":[263,336],"tour":[264],"careworker.":[267],"Thus,":[268],"looking":[271],"minimum":[274,428,486],"independent":[275],"partition.":[277],"Since":[278],"graphs":[280],"chordal,":[282],"\ufb01nd":[285,402],"perfect":[287,307],"elimination":[288],"ordering":[289,303],"V":[291],"time.":[294,408],"By":[295],"applying":[296],"greedy":[298],"coloring":[299,308],"algorithm":[300,477],"obtain":[305],"graph,":[311,373],"say":[315,426],"solution":[317,482],"optimal":[320],"careworkers":[323],"every":[326],"color":[333],"tour.For":[337],"second":[339,497],"tasks":[348],"anymore,":[349],"make":[352],"assumption":[354],"they":[356],"follow":[357],"triangle":[359],"inequality.":[360],"complementary":[364],"which":[369,483,491],"comparability":[372],"delete":[376],"between":[379,505],"incompatible":[380],"regards":[383],"times.":[386],"easily":[389],"check":[390],"still":[393],"have":[394],"comparability,":[398],"transitive":[404],"orientation":[405],"linear":[407],"Then,":[409,464],"Dilworth\u2019s":[410],"chain":[411],"decomposition":[412],"theorem":[413],"gives":[414],"us":[415],"width":[417],"vertices,":[422,456],"perform":[434],"transform":[439],"circulation":[444,470],"network":[445],"adding":[447],"source":[449],"sink,":[452],"lower":[453],"bounds":[454,460],"weights":[457],"upper":[459],"some":[462],"arcs.":[463],"minimum-cost":[469],"strongly":[474],"Tardos\u2019":[476],"get":[480],"requires":[484],"careworkers,":[489],"minimizes":[492],"part.This":[498],"method":[499],"lead":[501],"unbalanced":[503],"tours":[504],"caregivers,":[506],"would":[509],"interesting":[511],"related":[517],"future":[522],"work.":[523]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W3154875263","counts_by_year":[{"year":2020,"cited_by_count":2}],"updated_date":"2026-11-16T12:05:36.265796","created_date":"2021-04-26T00:00:00"}
