{"id":"https://openalex.org/W2108321445","doi":"https://doi.org/10.1109/icas.2010.32","title":"Greedy by Chance - Stochastic Greedy Algorithms","display_name":"Greedy by Chance - Stochastic Greedy Algorithms","publication_year":2010,"publication_date":"2010-03-01","ids":{"openalex":"https://openalex.org/W2108321445","doi":"https://doi.org/10.1109/icas.2010.32","mag":"2108321445"},"language":"en","primary_location":{"id":"doi:10.1109/icas.2010.32","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icas.2010.32","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 Sixth International Conference on Autonomic and Autonomous Systems","raw_type":"proceedings-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/A5030602854","display_name":"Viswanathan Kodaganallur","orcid":null},"institutions":[{"id":"https://openalex.org/I12524447","display_name":"Seton Hall University","ror":"https://ror.org/007tn5k56","country_code":"US","type":"education","lineage":["https://openalex.org/I12524447"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Viswanathan Kodaganallur","raw_affiliation_strings":["Seton Hall University, NJ, USA"],"affiliations":[{"raw_affiliation_string":"Seton Hall University, NJ, USA","institution_ids":["https://openalex.org/I12524447"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100813025","display_name":"Anup K. Sen","orcid":null},"institutions":[{"id":"https://openalex.org/I71495548","display_name":"Indian Institute of Management Calcutta","ror":"https://ror.org/02zhewk16","country_code":"IN","type":"education","lineage":["https://openalex.org/I71495548"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Anup K. Sen","raw_affiliation_strings":["Indian Institute of Management, Calcutta, Kolkata, India","Indian Inst. of Manage. Calcutta, Kolkata, India"],"affiliations":[{"raw_affiliation_string":"Indian Institute of Management, Calcutta, Kolkata, India","institution_ids":["https://openalex.org/I71495548"]},{"raw_affiliation_string":"Indian Inst. of Manage. Calcutta, Kolkata, India","institution_ids":["https://openalex.org/I71495548"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5030602854"],"corresponding_institution_ids":["https://openalex.org/I12524447"],"apc_list":null,"apc_paid":null,"fwci":1.3531,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.8487468,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"2","issue":null,"first_page":"182","last_page":"187"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9983000159263611,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9983000159263611,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9983000159263611,"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/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.9952999949455261,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.8592807650566101},{"id":"https://openalex.org/keywords/knapsack-problem","display_name":"Knapsack problem","score":0.8408495187759399},{"id":"https://openalex.org/keywords/greedy-randomized-adaptive-search-procedure","display_name":"Greedy randomized adaptive search procedure","score":0.7700426578521729},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.595604419708252},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5913822054862976},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.564630925655365},{"id":"https://openalex.org/keywords/simulated-annealing","display_name":"Simulated annealing","score":0.5350884795188904},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.42841577529907227},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.32567280530929565}],"concepts":[{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.8592807650566101},{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.8408495187759399},{"id":"https://openalex.org/C126221529","wikidata":"https://www.wikidata.org/wiki/Q3116070","display_name":"Greedy randomized adaptive search procedure","level":3,"score":0.7700426578521729},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.595604419708252},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5913822054862976},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.564630925655365},{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.5350884795188904},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.42841577529907227},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.32567280530929565}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icas.2010.32","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icas.2010.32","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 Sixth International Conference on Autonomic and Autonomous Systems","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W181821166","https://openalex.org/W187767610","https://openalex.org/W206942027","https://openalex.org/W1546279261","https://openalex.org/W1591939288","https://openalex.org/W1602205689","https://openalex.org/W1776713878","https://openalex.org/W1965680834","https://openalex.org/W1969483458","https://openalex.org/W1974234589","https://openalex.org/W2047903283","https://openalex.org/W2053913299","https://openalex.org/W2066671865","https://openalex.org/W2069323107","https://openalex.org/W2108923244","https://openalex.org/W2119064613","https://openalex.org/W2122967269","https://openalex.org/W2123948245","https://openalex.org/W2162661453","https://openalex.org/W2912248191","https://openalex.org/W4205900284","https://openalex.org/W6607571859","https://openalex.org/W6608300155"],"related_works":["https://openalex.org/W1984030868","https://openalex.org/W2359219221","https://openalex.org/W2357796514","https://openalex.org/W2393014972","https://openalex.org/W2357595179","https://openalex.org/W2277088917","https://openalex.org/W2891162720","https://openalex.org/W2351136238","https://openalex.org/W2167807475","https://openalex.org/W2169800510"],"abstract_inverted_index":{"For":[0],"many":[1,32],"complex":[2],"combinatorial":[3],"optimization":[4],"problems,":[5],"obtaining":[6],"good":[7],"solutions":[8,28,76],"quickly":[9],"is":[10],"of":[11,19,46,98],"value":[12],"either":[13],"by":[14],"itself":[15],"or":[16],"as":[17,101],"part":[18],"an":[20],"exact":[21],"algorithm.":[22],"Greedy":[23],"algorithms":[24,41,100,118],"to":[25,79],"obtain":[26],"such":[27],"are":[29,43],"known":[30],"for":[31],"problems.":[33,68],"In":[34],"this":[35],"paper":[36],"we":[37],"present":[38],"stochastic":[39],"greedy":[40,48,84,107],"which":[42],"perturbed":[44],"versions":[45],"standard":[47,57,83],"algorithms,":[49],"and":[50,56,64,86,109,119],"report":[51],"on":[52,61],"experiments":[53],"using":[54],"learned":[55],"probability":[58],"distributions":[59],"conducted":[60],"knapsack":[62],"problems":[63],"single":[65],"machine":[66],"sequencing":[67],"The":[69],"results":[70],"indicate":[71],"that":[72],"the":[73,82,96,104,110],"approach":[74],"produces":[75],"significantly":[77],"closer":[78],"optimal":[80],"than":[81],"approach,":[85],"runs":[87],"quite":[88],"fast.":[89],"It":[90],"can":[91],"thus":[92],"be":[93],"seen":[94],"in":[95],"space":[97],"approximate":[99],"falling":[102],"between":[103],"very":[105],"quick":[106],"approaches":[108,115],"relatively":[111],"slower":[112],"soft":[113],"computing":[114],"like":[116],"genetic":[117],"simulated":[120],"annealing.":[121]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}