{"id":"https://openalex.org/W2887430501","doi":"https://doi.org/10.3934/amc.2018026","title":"Improved attacks on knapsack problem with their variants and a knapsack type ID-scheme","display_name":"Improved attacks on knapsack problem with their variants and a knapsack type ID-scheme","publication_year":2018,"publication_date":"2018-01-01","ids":{"openalex":"https://openalex.org/W2887430501","doi":"https://doi.org/10.3934/amc.2018026","mag":"2887430501"},"language":"en","primary_location":{"id":"doi:10.3934/amc.2018026","is_oa":true,"landing_page_url":"https://doi.org/10.3934/amc.2018026","pdf_url":"https://www.aimsciences.org/article/exportPdf?id=c1bbdc4c-a492-4dd6-b9de-88a63ed039e6","source":{"id":"https://openalex.org/S161492159","display_name":"Advances in Mathematics of Communications","issn_l":"1930-5338","issn":["1930-5338","1930-5346"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315844","host_organization_name":"American Institute of Mathematical Sciences","host_organization_lineage":["https://openalex.org/P4310315844"],"host_organization_lineage_names":["American Institute of Mathematical Sciences"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Advances in Mathematics of Communications","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://www.aimsciences.org/article/exportPdf?id=c1bbdc4c-a492-4dd6-b9de-88a63ed039e6","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5035966908","display_name":"Konstantinos A. Draziotis","orcid":"https://orcid.org/0000-0002-1345-5595"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Konstantinos A. Draziotis","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5026970350","display_name":"Anastasia Papadopoulou","orcid":null},"institutions":[{"id":"https://openalex.org/I21370196","display_name":"Aristotle University of Thessaloniki","ror":"https://ror.org/02j61yw88","country_code":"GR","type":"education","lineage":["https://openalex.org/I21370196"]}],"countries":["GR"],"is_corresponding":false,"raw_author_name":"Anastasia Papadopoulou","raw_affiliation_strings":["Aristotle University of Thessaloniki, Department of Mathematics, Thessaloniki 54124, Greece"],"affiliations":[{"raw_affiliation_string":"Aristotle University of Thessaloniki, Department of Mathematics, Thessaloniki 54124, Greece","institution_ids":["https://openalex.org/I21370196"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5035966908"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.11186558,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"12","issue":"3","first_page":"429","last_page":"449"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9986000061035156,"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"}},"topics":[{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9986000061035156,"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/T12288","display_name":"Optimization and Search Problems","score":0.9980000257492065,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9923999905586243,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/knapsack-problem","display_name":"Knapsack problem","score":0.9953539371490479},{"id":"https://openalex.org/keywords/continuous-knapsack-problem","display_name":"Continuous knapsack problem","score":0.8105175495147705},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8045700788497925},{"id":"https://openalex.org/keywords/polynomial-time-approximation-scheme","display_name":"Polynomial-time approximation scheme","score":0.7418273091316223},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.6531004905700684},{"id":"https://openalex.org/keywords/change-making-problem","display_name":"Change-making problem","score":0.5970252156257629},{"id":"https://openalex.org/keywords/cutting-stock-problem","display_name":"Cutting stock problem","score":0.4972083866596222},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4881459176540375},{"id":"https://openalex.org/keywords/space","display_name":"Space (punctuation)","score":0.4365634024143219},{"id":"https://openalex.org/keywords/type","display_name":"Type (biology)","score":0.4295305609703064},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.41624781489372253},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.28861963748931885},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.1435464322566986},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.05611741542816162}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.9953539371490479},{"id":"https://openalex.org/C94569963","wikidata":"https://www.wikidata.org/wiki/Q5165487","display_name":"Continuous knapsack problem","level":3,"score":0.8105175495147705},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8045700788497925},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.7418273091316223},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.6531004905700684},{"id":"https://openalex.org/C17722475","wikidata":"https://www.wikidata.org/wiki/Q3406279","display_name":"Change-making problem","level":4,"score":0.5970252156257629},{"id":"https://openalex.org/C37307619","wikidata":"https://www.wikidata.org/wiki/Q1306230","display_name":"Cutting stock problem","level":3,"score":0.4972083866596222},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4881459176540375},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.4365634024143219},{"id":"https://openalex.org/C2777299769","wikidata":"https://www.wikidata.org/wiki/Q3707858","display_name":"Type (biology)","level":2,"score":0.4295305609703064},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.41624781489372253},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.28861963748931885},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.1435464322566986},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.05611741542816162},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.3934/amc.2018026","is_oa":true,"landing_page_url":"https://doi.org/10.3934/amc.2018026","pdf_url":"https://www.aimsciences.org/article/exportPdf?id=c1bbdc4c-a492-4dd6-b9de-88a63ed039e6","source":{"id":"https://openalex.org/S161492159","display_name":"Advances in Mathematics of Communications","issn_l":"1930-5338","issn":["1930-5338","1930-5346"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315844","host_organization_name":"American Institute of Mathematical Sciences","host_organization_lineage":["https://openalex.org/P4310315844"],"host_organization_lineage_names":["American Institute of Mathematical Sciences"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Advances in Mathematics of Communications","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.3934/amc.2018026","is_oa":true,"landing_page_url":"https://doi.org/10.3934/amc.2018026","pdf_url":"https://www.aimsciences.org/article/exportPdf?id=c1bbdc4c-a492-4dd6-b9de-88a63ed039e6","source":{"id":"https://openalex.org/S161492159","display_name":"Advances in Mathematics of Communications","issn_l":"1930-5338","issn":["1930-5338","1930-5346"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315844","host_organization_name":"American Institute of Mathematical Sciences","host_organization_lineage":["https://openalex.org/P4310315844"],"host_organization_lineage_names":["American Institute of Mathematical Sciences"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Advances in Mathematics of Communications","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2887430501.pdf","grobid_xml":"https://content.openalex.org/works/W2887430501.grobid-xml"},"referenced_works_count":29,"referenced_works":["https://openalex.org/W139993337","https://openalex.org/W258537497","https://openalex.org/W1482956368","https://openalex.org/W1485280854","https://openalex.org/W1490771242","https://openalex.org/W1499237070","https://openalex.org/W1585924679","https://openalex.org/W1598269861","https://openalex.org/W1766548092","https://openalex.org/W1845765495","https://openalex.org/W1856875316","https://openalex.org/W1968182591","https://openalex.org/W1984481156","https://openalex.org/W1993440508","https://openalex.org/W2011039300","https://openalex.org/W2012589104","https://openalex.org/W2049594334","https://openalex.org/W2070268091","https://openalex.org/W2094303942","https://openalex.org/W2095708839","https://openalex.org/W2119249902","https://openalex.org/W2126483728","https://openalex.org/W2141040012","https://openalex.org/W2150780437","https://openalex.org/W2159641801","https://openalex.org/W2163469693","https://openalex.org/W2295428206","https://openalex.org/W4231916799","https://openalex.org/W4251436657"],"related_works":["https://openalex.org/W2889442766","https://openalex.org/W4249611560","https://openalex.org/W2005493932","https://openalex.org/W2381035939","https://openalex.org/W2412614002","https://openalex.org/W2087209118","https://openalex.org/W2122137596","https://openalex.org/W2168163332","https://openalex.org/W2993365626","https://openalex.org/W4256002267"],"abstract_inverted_index":{"In":[0],"the":[1,23,29,34,68],"present":[2,51],"study":[3,28],"we":[4,27,50,59],"consider":[5],"two":[6],"variants":[7],"of":[8],"Schnorr-Shevchenko":[9],"method":[10],"(SS)":[11],"for":[12],"solving":[13],"hard":[14],"knapsack":[15,31,43,70],"problems,":[16],"which":[17],"are":[18],"on":[19,67],"average":[20],"faster":[21],"than":[22],"SS":[24],"method.":[25],"Furthermore,":[26],"compact":[30,69],"problem":[32,44],"i.e.":[33],"solution":[35],"space":[36],"is":[37],"not":[38],"{0,":[39],"1}":[40],"as":[41],"in":[42],"but":[45],"some":[46],"larger":[47],"set,":[48],"and":[49],"an":[52],"algorithm":[53],"to":[54],"attack":[55],"this":[56],"problem.":[57,71],"Finally,":[58],"provide":[60],"a":[61],"three":[62],"move":[63],"sound":[64],"id-scheme":[65],"based":[66]},"counts_by_year":[{"year":2024,"cited_by_count":1}],"updated_date":"2026-03-25T13:04:00.132906","created_date":"2025-10-10T00:00:00"}