{"id":"https://openalex.org/W2041207048","doi":"https://doi.org/10.1093/comjnl/bxq010","title":"Fast Distributed Near-Optimum Assignment of Assets to Tasks","display_name":"Fast Distributed Near-Optimum Assignment of Assets to Tasks","publication_year":2010,"publication_date":"2010-02-19","ids":{"openalex":"https://openalex.org/W2041207048","doi":"https://doi.org/10.1093/comjnl/bxq010","mag":"2041207048"},"language":"en","primary_location":{"id":"doi:10.1093/comjnl/bxq010","is_oa":false,"landing_page_url":"https://doi.org/10.1093/comjnl/bxq010","pdf_url":null,"source":{"id":"https://openalex.org/S44643521","display_name":"The Computer Journal","issn_l":"0010-4620","issn":["0010-4620","1460-2067"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311648","host_organization_name":"Oxford University Press","host_organization_lineage":["https://openalex.org/P4310311648","https://openalex.org/P4310311647"],"host_organization_lineage_names":["Oxford University Press","University of Oxford"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Computer Journal","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/A5074413858","display_name":"Erol Gelenbe","orcid":"https://orcid.org/0000-0001-9688-2201"},"institutions":[{"id":"https://openalex.org/I47508984","display_name":"Imperial College London","ror":"https://ror.org/041kmwe10","country_code":"GB","type":"education","lineage":["https://openalex.org/I47508984"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"E. Gelenbe","raw_affiliation_strings":["Department of Electrical & Electronic Engineering, Imperial College, London SW7 2BT, UK"],"affiliations":[{"raw_affiliation_string":"Department of Electrical & Electronic Engineering, Imperial College, London SW7 2BT, UK","institution_ids":["https://openalex.org/I47508984"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5024136638","display_name":"Stelios Timotheou","orcid":"https://orcid.org/0000-0002-3617-7962"},"institutions":[{"id":"https://openalex.org/I47508984","display_name":"Imperial College London","ror":"https://ror.org/041kmwe10","country_code":"GB","type":"education","lineage":["https://openalex.org/I47508984"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"S. Timotheou","raw_affiliation_strings":["Department of Electrical & Electronic Engineering, Imperial College, London SW7 2BT, UK"],"affiliations":[{"raw_affiliation_string":"Department of Electrical & Electronic Engineering, Imperial College, London SW7 2BT, UK","institution_ids":["https://openalex.org/I47508984"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5015692680","display_name":"David Nicholson","orcid":null},"institutions":[{"id":"https://openalex.org/I4210143731","display_name":"BAE Systems (United Kingdom)","ror":"https://ror.org/04p8ejq70","country_code":"GB","type":"company","lineage":["https://openalex.org/I4210143731"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"D. Nicholson","raw_affiliation_strings":["BAE Systems, Sowerby Building, Filton, Bristol BS34 7QW, UK"],"affiliations":[{"raw_affiliation_string":"BAE Systems, Sowerby Building, Filton, Bristol BS34 7QW, UK","institution_ids":["https://openalex.org/I4210143731"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5074413858"],"corresponding_institution_ids":["https://openalex.org/I47508984"],"apc_list":{"value":2635,"currency":"GBP","value_usd":3232},"apc_paid":null,"fwci":6.7656,"has_fulltext":false,"cited_by_count":38,"citation_normalized_percentile":{"value":0.96645546,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"53","issue":"9","first_page":"1360","last_page":"1369"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9965000152587891,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9965000152587891,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10320","display_name":"Neural Networks and Applications","score":0.9929999709129333,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T12176","display_name":"Optimization and Packing Problems","score":0.9847000241279602,"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/computer-science","display_name":"Computer science","score":0.7616398334503174},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.6991940140724182},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.6699947714805603},{"id":"https://openalex.org/keywords/generalized-assignment-problem","display_name":"Generalized assignment problem","score":0.6644429564476013},{"id":"https://openalex.org/keywords/weapon-target-assignment-problem","display_name":"Weapon target assignment problem","score":0.6298108100891113},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6106509566307068},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5762856006622314},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.5563924908638},{"id":"https://openalex.org/keywords/asset","display_name":"Asset (computer security)","score":0.5237764716148376},{"id":"https://openalex.org/keywords/assignment-problem","display_name":"Assignment problem","score":0.5211777091026306},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.353909969329834},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.30261868238449097},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2651926875114441},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.10272225737571716}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7616398334503174},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.6991940140724182},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.6699947714805603},{"id":"https://openalex.org/C194146004","wikidata":"https://www.wikidata.org/wiki/Q5532462","display_name":"Generalized assignment problem","level":3,"score":0.6644429564476013},{"id":"https://openalex.org/C30202268","wikidata":"https://www.wikidata.org/wiki/Q7978065","display_name":"Weapon target assignment problem","level":4,"score":0.6298108100891113},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6106509566307068},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5762856006622314},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.5563924908638},{"id":"https://openalex.org/C76178495","wikidata":"https://www.wikidata.org/wiki/Q4808784","display_name":"Asset (computer security)","level":2,"score":0.5237764716148376},{"id":"https://openalex.org/C85044808","wikidata":"https://www.wikidata.org/wiki/Q620614","display_name":"Assignment problem","level":2,"score":0.5211777091026306},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.353909969329834},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.30261868238449097},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2651926875114441},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.10272225737571716},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C187736073","wikidata":"https://www.wikidata.org/wiki/Q2920921","display_name":"Management","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1093/comjnl/bxq010","is_oa":false,"landing_page_url":"https://doi.org/10.1093/comjnl/bxq010","pdf_url":null,"source":{"id":"https://openalex.org/S44643521","display_name":"The Computer Journal","issn_l":"0010-4620","issn":["0010-4620","1460-2067"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311648","host_organization_name":"Oxford University Press","host_organization_lineage":["https://openalex.org/P4310311648","https://openalex.org/P4310311647"],"host_organization_lineage_names":["Oxford University Press","University of Oxford"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Computer Journal","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","score":0.7900000214576721,"display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W141747677","https://openalex.org/W195211043","https://openalex.org/W925666063","https://openalex.org/W1491270287","https://openalex.org/W1573333435","https://openalex.org/W1592570595","https://openalex.org/W1605037220","https://openalex.org/W1975967782","https://openalex.org/W1978963139","https://openalex.org/W1989179252","https://openalex.org/W1990474526","https://openalex.org/W2009978643","https://openalex.org/W2010470943","https://openalex.org/W2013603106","https://openalex.org/W2019426691","https://openalex.org/W2024551903","https://openalex.org/W2032663983","https://openalex.org/W2033213616","https://openalex.org/W2034226536","https://openalex.org/W2052417550","https://openalex.org/W2056377128","https://openalex.org/W2057461902","https://openalex.org/W2078448419","https://openalex.org/W2086917808","https://openalex.org/W2107564197","https://openalex.org/W2112913811","https://openalex.org/W2122376145","https://openalex.org/W2127005563","https://openalex.org/W2142369616","https://openalex.org/W2149570311","https://openalex.org/W2157609081","https://openalex.org/W2160820123","https://openalex.org/W2165115362"],"related_works":["https://openalex.org/W2937059810","https://openalex.org/W1586515950","https://openalex.org/W2358965113","https://openalex.org/W2379349345","https://openalex.org/W2382974548","https://openalex.org/W2760584304","https://openalex.org/W2113934189","https://openalex.org/W2311097448","https://openalex.org/W2028174200","https://openalex.org/W3086805279"],"abstract_inverted_index":{"We":[0,81],"investigate":[1],"the":[2,16,57,60,83,123,130,134,142,146,154,178,189,200,204,224,227],"assignment":[3,36,64,131],"of":[4,15,26,37,59,65,85,116,138,145,169,186,199,219,226],"assets":[5,19,66,86],"to":[6,40,67,79,87,91],"tasks":[7,21,68,88],"where":[8],"each":[9,34],"asset":[10,39],"can":[11,231],"potentially":[12],"execute":[13,20],"any":[14,63],"tasks,":[17],"but":[18],"with":[22,33,56,153,161],"a":[23,30,41,45,53,97,117,162,166],"probabilistic":[24],"outcome":[25],"success.":[27],"There":[28],"is":[29,47,51,110,141,182,215,218],"cost":[31,54,75,201],"associated":[32,55],"possible":[35],"an":[38,72],"task,":[42],"and":[43,127,217],"if":[44],"task":[46],"not":[48],"executed,":[49],"there":[50],"also":[52],"non-execution":[58],"task.":[61],"Thus,":[62],"will":[69],"result":[70],"in":[71,89,125,184,223],"expected":[73,94],"overall":[74],"which":[76],"we":[77],"wish":[78],"minimize.":[80],"formulate":[82],"allocation":[84],"order":[90],"minimize":[92],"this":[93],"cost,":[95],"as":[96,158,160],"nonlinear":[98],"combinatorial":[99],"optimization":[100],"problem.":[101],"A":[102],"neural":[103,119],"network":[104,120,124],"approach":[105,148,164,214],"for":[106,207,234],"its":[107],"approximate":[108],"solution":[109,157,206],"proposed":[111,147,179],"based":[112],"on":[113,194],"selecting":[114,133],"parameters":[115],"random":[118],"(RNN),":[121],"solving":[122],"equilibrium,":[126],"then":[128],"identifying":[129],"by":[132,151,203],"neurons":[135],"whose":[136],"probability":[137],"being":[139],"active":[140],"highest.":[143],"Evaluations":[144],"are":[149],"conducted":[150],"comparison":[152],"optimum":[155],"(enumerative)":[156],"well":[159],"greedy":[163,190],"over":[165],"large":[167],"number":[168],"randomly":[170],"generated":[171],"test":[172],"cases.":[173],"The":[174,212],"evaluation":[175],"indicates":[176],"that":[177],"RNN-based":[180,213],"algorithm":[181],"better":[183],"terms":[185],"performance":[187],"than":[188],"heuristic,":[191],"consistently":[192],"achieving":[193],"average":[195],"results":[196],"within":[197],"5%":[198],"obtained":[202],"optimal":[205],"all":[208],"problem":[209],"cases":[210],"considered.":[211],"fast":[216],"low":[220],"polynomial":[221],"complexity":[222],"size":[225],"problem,":[228],"while":[229],"it":[230],"be":[232],"used":[233],"decentralized":[235],"decision":[236],"making.":[237]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":5}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}