{"id":"https://openalex.org/W2146832545","doi":"https://doi.org/10.1109/hipc.1998.737986","title":"Parallel algorithms for vehicle routing problems","display_name":"Parallel algorithms for vehicle routing problems","publication_year":2002,"publication_date":"2002-11-27","ids":{"openalex":"https://openalex.org/W2146832545","doi":"https://doi.org/10.1109/hipc.1998.737986","mag":"2146832545"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/hipc.1998.737986","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},"type":"article","type_crossref":"proceedings-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/A5086575422","display_name":"K. Jeevan Madhu","orcid":null},"institutions":[{"id":"https://openalex.org/I94234084","display_name":"Indian Institute of Technology Kanpur","ror":"https://ror.org/05pjsgx75","country_code":"IN","type":"funder","lineage":["https://openalex.org/I94234084"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"K. Jeevan Madhu","raw_affiliation_strings":["Computer Science and Engineering, Indian Institute of Technology, Kanpur, India","Motorola India Electronics Limited, Bangalore, India"],"affiliations":[{"raw_affiliation_string":"Computer Science and Engineering, Indian Institute of Technology, Kanpur, India","institution_ids":["https://openalex.org/I94234084"]},{"raw_affiliation_string":"Motorola India Electronics Limited, Bangalore, India","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101785418","display_name":"Sanjeev Saxena","orcid":"https://orcid.org/0000-0002-9581-1732"},"institutions":[{"id":"https://openalex.org/I94234084","display_name":"Indian Institute of Technology Kanpur","ror":"https://ror.org/05pjsgx75","country_code":"IN","type":"funder","lineage":["https://openalex.org/I94234084"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"S. Saxena","raw_affiliation_strings":["Computer Science and Engineering, Indian Institute of Technology, Kanpur, India"],"affiliations":[{"raw_affiliation_string":"Computer Science and Engineering, Indian Institute of Technology, Kanpur, India","institution_ids":["https://openalex.org/I94234084"]}]}],"institution_assertions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"fulltext_origin":"ngrams","cited_by_count":1,"citation_normalized_percentile":{"value":0.264351,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":57,"max":64},"biblio":{"volume":null,"issue":null,"first_page":"171","last_page":"178"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9992,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T12288","display_name":"Optimization and Search Problems","score":0.9992,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.998,"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.996,"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":[],"concepts":[{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.649037},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6465592},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5844611},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5386628},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.5253529},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5103528},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4520254},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.43578732},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.31969255}],"mesh":[],"locations_count":1,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/hipc.1998.737986","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8","score":0.45}],"grants":[],"datasets":[],"versions":[],"referenced_works_count":13,"referenced_works":["https://openalex.org/W1995284651","https://openalex.org/W1997403587","https://openalex.org/W2001364911","https://openalex.org/W2039766013","https://openalex.org/W2055569927","https://openalex.org/W2072400378","https://openalex.org/W2084224084","https://openalex.org/W2116691041","https://openalex.org/W2126598061","https://openalex.org/W2338905098","https://openalex.org/W2611491551","https://openalex.org/W2743045177","https://openalex.org/W80909727"],"related_works":["https://openalex.org/W4389820491","https://openalex.org/W4377371889","https://openalex.org/W4299305030","https://openalex.org/W2521054645","https://openalex.org/W2113270940","https://openalex.org/W2089134982","https://openalex.org/W2040347389","https://openalex.org/W2018076478","https://openalex.org/W1862126075","https://openalex.org/W1838063489"],"abstract_inverted_index":{"In":[0],"a":[1,33,87,123,145,174,195],"complete":[2],"directed":[3],"weighted":[4],"graph":[5],"there":[6],"are":[7,120,171],"jobs":[8,60],"located":[9],"at":[10,51,158],"nodes":[11,85],"of":[12,48,84,155],"the":[13,28,46,49,59,72,77,153],"graph.":[14],"Job":[15],"i":[16],"has":[17,56],"an":[18,91,131,182],"associated":[19],"processing":[20],"time":[21,24,35,64,95,118,135,147,169,186,197],"or":[22],"handling":[23],"h/sub":[25],"i/,":[26,38],"and":[27,54,144,193],"job":[29],"must":[30],"start":[31],"within":[32,61],"prespecified":[34],"window":[36],"[r/sub":[37],"d/sub":[39],"i/].":[40],"A":[41],"vehicle":[42],"can":[43],"move":[44],"on":[45,71],"arcs":[47],"graph,":[50],"unit":[52],"speed":[53],"that":[55],"to":[57],"execute":[58],"their":[62],"respective":[63],"windows.":[65],"We":[66,89],"consider":[67],"three":[68],"different":[69],"problems":[70],"CREW":[73],"PRAM.":[74],"(1)":[75],"Find":[76],"minimum":[78,108],"cost":[79],"routes":[80],"between":[81],"all":[82,105,159],"pairs":[83],"in":[86,107],"network.":[88],"give":[90],"O(log/sup":[92,132,183],"3/":[93,133],"n)":[94,134,185],"algorithm":[96,137,170,187],"with":[97,188],"n/sup":[98,139,189],"4//log/sup":[99,140],"2/":[100,141,184],"n":[101,142,191],"processors.":[102],"(2)":[103],"Services":[104],"locations":[106],"time.":[109],"The":[110,161],"general":[111,162],"problem":[112,163],"is":[113,164],"NP-complete":[114,165],"but":[115,166],"O(n/sup":[116,167],"2/)":[117,168],"algorithms":[119],"known":[121,172],"for":[122,126,173,177],"special":[124,175],"case;":[125,176],"this":[127,178],"case":[128],"we":[129,180],"obtain":[130,181],"parallel":[136,149,199],"using":[138],"processors":[143,192],"linear":[146,196],"optimal":[148,198],"algorithm.":[150,200],"(3)":[151],"Minimize":[152],"sum":[154],"waiting":[156],"times":[157],"locations.":[160],"case,":[179],"3//log":[190],"also":[194]},"abstract_inverted_index_v3":null,"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2146832545","counts_by_year":[],"updated_date":"2025-03-18T17:06:23.483862","created_date":"2016-06-24"}