{"id":"https://openalex.org/W2949175162","doi":"https://doi.org/10.31142/ijtsrd22925","title":"Implementation of Combinatorial Algorithms using Optimization Techniques","display_name":"Implementation of Combinatorial Algorithms using Optimization Techniques","publication_year":2019,"publication_date":"2019-04-30","ids":{"openalex":"https://openalex.org/W2949175162","doi":"https://doi.org/10.31142/ijtsrd22925","mag":"2949175162"},"language":"en","primary_location":{"id":"doi:10.31142/ijtsrd22925","doi":"https://doi.org/10.31142/ijtsrd22925","is_oa":true,"landing_page_url":"https://doi.org/10.31142/ijtsrd22925","pdf_url":"https://www.ijtsrd.com/papers/ijtsrd22925.pdf","source":{"id":"https://openalex.org/S2914917527","display_name":"International Journal of Trend in Scientific Research and Development","issn_l":"2456-6470","issn":["2456-6470"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4322696778","host_organization_name":"Rekha Patel","host_organization_lineage":["https://openalex.org/P4322696778"],"host_organization_lineage_names":["Rekha Patel"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Trend in Scientific Research and Development","raw_type":"journal-article"},"volume":null,"type":"article","is_traditional":true,"indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://www.ijtsrd.com/papers/ijtsrd22925.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5035889457","display_name":"Youssef Bassil","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Youssef Bassil","raw_affiliation_strings":["Researcher, LACSC -Lebanese Association for Computational Sciences Registered, Beirut, Lebanon"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Researcher, LACSC -Lebanese Association for Computational Sciences Registered, Beirut, Lebanon","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5035889457"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"Volume-3","issue":"Issue-3","first_page":"660","last_page":"666"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.8910999894142151,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.8910999894142151,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.08630000054836273,"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.003700000001117587,"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/combinatorial-optimization","display_name":"combinatorial optimization","score":0.9990000128746033},{"id":"https://openalex.org/keywords/knapsack-problem","display_name":"knapsack problem","score":0.9200000166893005},{"id":"https://openalex.org/keywords/traveling-salesman-problem","display_name":"traveling salesman problem","score":0.9950000047683716},{"id":"https://openalex.org/keywords/combinatorial-algorithms","display_name":"combinatorial algorithms","score":0.8489999771118164},{"id":"https://openalex.org/keywords/time-complexity-analysis","display_name":"time complexity analysis","score":0.7200000286102295},{"id":"https://openalex.org/keywords/parallelization","display_name":"parallelization","score":0.5220000147819519}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6365435123443604},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4225956201553345}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.31142/ijtsrd22925","doi":"https://doi.org/10.31142/ijtsrd22925","is_oa":true,"landing_page_url":"https://doi.org/10.31142/ijtsrd22925","pdf_url":"https://www.ijtsrd.com/papers/ijtsrd22925.pdf","source":{"id":"https://openalex.org/S2914917527","display_name":"International Journal of Trend in Scientific Research and Development","issn_l":"2456-6470","issn":["2456-6470"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4322696778","host_organization_name":"Rekha Patel","host_organization_lineage":["https://openalex.org/P4322696778"],"host_organization_lineage_names":["Rekha Patel"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Trend in Scientific Research and Development","raw_type":"journal-article"},{"id":"pmh:oai:zenodo.org:3584111","doi":null,"is_oa":true,"landing_page_url":"https://zenodo.org/record/3584111","pdf_url":null,"source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"International Journal of Trend in Scientific Research and Development 3(3) 660-666","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"doi:10.31142/ijtsrd22925","doi":"https://doi.org/10.31142/ijtsrd22925","is_oa":true,"landing_page_url":"https://doi.org/10.31142/ijtsrd22925","pdf_url":"https://www.ijtsrd.com/papers/ijtsrd22925.pdf","source":{"id":"https://openalex.org/S2914917527","display_name":"International Journal of Trend in Scientific Research and Development","issn_l":"2456-6470","issn":["2456-6470"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4322696778","host_organization_name":"Rekha Patel","host_organization_lineage":["https://openalex.org/P4322696778"],"host_organization_lineage_names":["Rekha Patel"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Trend in Scientific Research and Development","raw_type":"journal-article"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2949175162.pdf","grobid_xml":"https://content.openalex.org/works/W2949175162.grobid-xml"},"referenced_works_count":7,"referenced_works":["https://openalex.org/W568507336","https://openalex.org/W656060844","https://openalex.org/W1963721569","https://openalex.org/W1973002902","https://openalex.org/W2043415250","https://openalex.org/W2119064613","https://openalex.org/W2141461755"],"related_works":["https://openalex.org/W2754024889","https://openalex.org/W1184715927","https://openalex.org/W2273581051","https://openalex.org/W7204953464","https://openalex.org/W6958479237","https://openalex.org/W4408421633","https://openalex.org/W2119419950","https://openalex.org/W7096757088","https://openalex.org/W170302693","https://openalex.org/W4409762586"],"abstract_inverted_index":{"In":[0],"theoretical":[1],"computer":[2],"science,":[3],"combinatorial":[4,59,93,117],"optimization":[5,19,60,118],"problems":[6,91,119],"are":[7,95,222],"about":[8,136,153,170],"finding":[9,137,171],"an":[10,30],"optimal":[11,64],"item":[12],"from":[13],"a":[14,36,78,155,158,176,181,213],"finite":[15],"set":[16,183],"of":[17,23,29,86,142,184],"objects.Combinatorial":[18],"is":[20,35,135,152,169,187,194,200,210],"the":[21,45,63,83,96,99,104,121,124,129,138,147,161,172,192,197,208,219],"process":[22],"searching":[24],"for":[25,58,114],"maxima":[26],"or":[27],"minima":[28],"unbiased":[31],"function":[32],"whose":[33],"domain":[34],"discrete":[37],"and":[38,81,103,128,239],"large":[39],"configuration":[40],"space.It":[41],"often":[42],"involves":[43],"determining":[44,62,72,82],"way":[46,65],"to":[47,52,55,66,76,88,157,175,188,223],"efficiently":[48],"allocate":[49],"resources":[50],"used":[51],"find":[53],"solutions":[54],"mathematical":[56],"problems.Applications":[57],"include":[61],"deliver":[67],"packages":[68],"in":[69],"logistics":[70],"applications,":[71],"taxis":[73],"best":[74,84],"route":[75],"reach":[77],"destination":[79,177],"address,":[80],"allocation":[85],"jobs":[87],"people.Some":[89],"common":[90],"involving":[92],"optimizations":[94],"Knapsack":[97,122,133],"problem,":[98,102,123,127],"Job":[100,125,149],"Assignment":[101,126,150],"Travelling":[105],"Salesman":[106,131,167],"problem.This":[107],"paper":[108],"proposes":[109],"three":[110,116],"new":[111],"optimized":[112],"algorithms":[113,221],"solving":[115],"namely":[120],"Traveling":[130,166],"respectively.The":[132],"problem":[134,151,168,186],"most":[139],"valuable":[140],"subset":[141],"items":[143],"that":[144,227],"fit":[145],"into":[146],"knapsack.The":[148],"assigning":[154],"person":[156],"job":[159],"with":[160,203],"lowest":[162],"total":[163],"cost":[164],"possible.The":[165],"shortest":[173],"tour":[174],"city":[178],"through":[179],"travelling":[180],"given":[182],"cities.Each":[185],"be":[189,224],"tackled":[190],"separately.First,":[191],"design":[193],"proposed,":[195],"then":[196],"pseudo":[198],"code":[199],"created":[201],"along":[202],"analyzing":[204],"its":[205],"time":[206,237],"complexity.Finally,":[207],"algorithm":[209],"implemented":[211],"using":[212],"high-level":[214],"programming":[215],"language.As":[216],"future":[217],"work,":[218],"proposed":[220],"parallelized":[225],"so":[226],"they":[228],"can":[229],"execute":[230],"on":[231],"multiprocessing":[232],"environments":[233],"making":[234],"their":[235],"execution":[236],"faster":[238],"more":[240],"scalable.":[241]},"counts_by_year":[],"updated_date":"2026-11-04T10:54:05.112534","created_date":"2019-06-27T00:00:00"}