{"id":"https://openalex.org/W2041871926","doi":"https://doi.org/10.1007/s00500-002-0240-4","title":"Tackling 0/1 knapsack problem with gene induction","display_name":"Tackling 0/1 knapsack problem with gene induction","publication_year":2003,"publication_date":"2003-10-01","ids":{"openalex":"https://openalex.org/W2041871926","doi":"https://doi.org/10.1007/s00500-002-0240-4","mag":"2041871926"},"language":"en","primary_location":{"id":"doi:10.1007/s00500-002-0240-4","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00500-002-0240-4","pdf_url":null,"source":{"id":"https://openalex.org/S65753830","display_name":"Soft Computing","issn_l":"1432-7643","issn":["1432-7643","1433-7479"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Soft Computing - A Fusion of Foundations, Methodologies and Applications","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/A5067303858","display_name":"Avnish Kumar Bhatia","orcid":"https://orcid.org/0000-0002-5240-2875"},"institutions":[{"id":"https://openalex.org/I91357014","display_name":"Banaras Hindu University","ror":"https://ror.org/04cdn2797","country_code":"IN","type":"education","lineage":["https://openalex.org/I91357014"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"A. K. Bhatia","raw_affiliation_strings":["Department of Computer Science, Banaras Hindu University, 21005, Varanasi, India","Department of Computer Science, Banaras Hindu University, Varanasi, India 21005#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Banaras Hindu University, 21005, Varanasi, India","institution_ids":["https://openalex.org/I91357014"]},{"raw_affiliation_string":"Department of Computer Science, Banaras Hindu University, Varanasi, India 21005#TAB#","institution_ids":["https://openalex.org/I91357014"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5090369629","display_name":"S. K. Basu","orcid":"https://orcid.org/0000-0001-5302-9155"},"institutions":[{"id":"https://openalex.org/I91357014","display_name":"Banaras Hindu University","ror":"https://ror.org/04cdn2797","country_code":"IN","type":"education","lineage":["https://openalex.org/I91357014"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"S. K. Basu","raw_affiliation_strings":["Department of Computer Science, Banaras Hindu University, 21005, Varanasi, India","Department of Computer Science, Banaras Hindu University, Varanasi, India 21005#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Banaras Hindu University, 21005, Varanasi, India","institution_ids":["https://openalex.org/I91357014"]},{"raw_affiliation_string":"Department of Computer Science, Banaras Hindu University, Varanasi, India 21005#TAB#","institution_ids":["https://openalex.org/I91357014"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5090369629"],"corresponding_institution_ids":["https://openalex.org/I91357014"],"apc_list":{"value":3190,"currency":"USD","value_usd":3190},"apc_paid":null,"fwci":1.5661,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.86977392,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"8","issue":"1","first_page":"1","last_page":"9"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9993000030517578,"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.9993000030517578,"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/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.9955000281333923,"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.9769999980926514,"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/knapsack-problem","display_name":"Knapsack problem","score":0.9767580032348633},{"id":"https://openalex.org/keywords/continuous-knapsack-problem","display_name":"Continuous knapsack problem","score":0.7717841863632202},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.656164824962616},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.6184852123260498},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.597348690032959},{"id":"https://openalex.org/keywords/mutation","display_name":"Mutation","score":0.47293734550476074},{"id":"https://openalex.org/keywords/operator","display_name":"Operator (biology)","score":0.46459412574768066},{"id":"https://openalex.org/keywords/population","display_name":"Population","score":0.46449995040893555},{"id":"https://openalex.org/keywords/polynomial-time-approximation-scheme","display_name":"Polynomial-time approximation scheme","score":0.4621013402938843},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4474428594112396},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3740394711494446},{"id":"https://openalex.org/keywords/gene","display_name":"Gene","score":0.29146766662597656},{"id":"https://openalex.org/keywords/biology","display_name":"Biology","score":0.19452854990959167},{"id":"https://openalex.org/keywords/genetics","display_name":"Genetics","score":0.13451573252677917},{"id":"https://openalex.org/keywords/gene-expression","display_name":"Gene expression","score":0.0886668860912323}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.9767580032348633},{"id":"https://openalex.org/C94569963","wikidata":"https://www.wikidata.org/wiki/Q5165487","display_name":"Continuous knapsack problem","level":3,"score":0.7717841863632202},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.656164824962616},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.6184852123260498},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.597348690032959},{"id":"https://openalex.org/C501734568","wikidata":"https://www.wikidata.org/wiki/Q42918","display_name":"Mutation","level":3,"score":0.47293734550476074},{"id":"https://openalex.org/C17020691","wikidata":"https://www.wikidata.org/wiki/Q139677","display_name":"Operator (biology)","level":5,"score":0.46459412574768066},{"id":"https://openalex.org/C2908647359","wikidata":"https://www.wikidata.org/wiki/Q2625603","display_name":"Population","level":2,"score":0.46449995040893555},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.4621013402938843},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4474428594112396},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3740394711494446},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.29146766662597656},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.19452854990959167},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.13451573252677917},{"id":"https://openalex.org/C150194340","wikidata":"https://www.wikidata.org/wiki/Q26972","display_name":"Gene expression","level":3,"score":0.0886668860912323},{"id":"https://openalex.org/C158448853","wikidata":"https://www.wikidata.org/wiki/Q425218","display_name":"Repressor","level":4,"score":0.0},{"id":"https://openalex.org/C149923435","wikidata":"https://www.wikidata.org/wiki/Q37732","display_name":"Demography","level":1,"score":0.0},{"id":"https://openalex.org/C144024400","wikidata":"https://www.wikidata.org/wiki/Q21201","display_name":"Sociology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s00500-002-0240-4","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00500-002-0240-4","pdf_url":null,"source":{"id":"https://openalex.org/S65753830","display_name":"Soft Computing","issn_l":"1432-7643","issn":["1432-7643","1433-7479"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Soft Computing - A Fusion of Foundations, Methodologies and Applications","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1803471726","https://openalex.org/W2015340728","https://openalex.org/W2017316844","https://openalex.org/W2037698864","https://openalex.org/W2066557391","https://openalex.org/W2097571405","https://openalex.org/W2137565093","https://openalex.org/W2142183404","https://openalex.org/W3023540311"],"related_works":["https://openalex.org/W4288642040","https://openalex.org/W2908214350","https://openalex.org/W3166857172","https://openalex.org/W3169691842","https://openalex.org/W1701984136","https://openalex.org/W2122137596","https://openalex.org/W2060645964","https://openalex.org/W1984121220","https://openalex.org/W1556368910","https://openalex.org/W1601835603"],"abstract_inverted_index":null,"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2013,"cited_by_count":2}],"updated_date":"2026-08-21T09:56:20.448147","created_date":"2025-10-10T00:00:00"}