{"id":"https://openalex.org/W2166165083","doi":"https://doi.org/10.5784/24-1-56","title":"On the efficient solvability of a simple class of nonlinear knapsack problems","display_name":"On the efficient solvability of a simple class of nonlinear knapsack problems","publication_year":2008,"publication_date":"2008-06-01","ids":{"openalex":"https://openalex.org/W2166165083","doi":"https://doi.org/10.5784/24-1-56","mag":"2166165083"},"language":"en","primary_location":{"id":"doi:10.5784/24-1-56","doi":"https://doi.org/10.5784/24-1-56","is_oa":true,"landing_page_url":"https://doi.org/10.5784/24-1-56","pdf_url":"https://orion.journals.ac.za/pub/article/download/56/56","source":{"id":"https://openalex.org/S2737688452","display_name":"Orion/ORiON","issn_l":"0259-191X","issn":["0259-191X","2224-0004"],"is_oa":true,"is_in_doaj":true,"is_core":true,"listed_in":["cwts-core","dhet","doaj","jpps-2"],"host_organization":"https://openalex.org/P4310315349","host_organization_name":"Operations Research Society of South Africa","host_organization_lineage":["https://openalex.org/P4310315349"],"host_organization_lineage_names":["Operations Research Society of South Africa"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ORiON","raw_type":"journal-article"},"volume":null,"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://orion.journals.ac.za/pub/article/download/56/56","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5074102187","display_name":"Stephan E Visagie","orcid":"https://orcid.org/0000-0002-0689-5736","observed_orcids":["https://orcid.org/0000-0002-0689-5736"]},"institutions":[{"id":"https://openalex.org/I26092322","display_name":"Stellenbosch University","ror":"https://ror.org/05bk57929","country_code":"ZA","type":"education","lineage":["https://openalex.org/I26092322"]}],"countries":["ZA"],"is_corresponding":true,"raw_author_name":"SE Visagie","raw_affiliation_strings":["Department of Logistics, University of Stellenbosch, Private Bag X1, Stellenbosch, 7602, South Africa,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Logistics, University of Stellenbosch, Private Bag X1, Stellenbosch, 7602, South Africa,","institution_ids":["https://openalex.org/I26092322"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5074102187"],"corresponding_institution_ids":["https://openalex.org/I26092322"],"apc_list":null,"apc_paid":null,"fwci":1.0071,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.85415656,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"24","issue":"1","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9922000169754028,"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.9922000169754028,"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.0015999999595806003,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.00139999995008111,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/necessary-conditions","display_name":"necessary conditions","score":0.5590000152587891},{"id":"https://openalex.org/keywords/sufficient-optimality-conditions","display_name":"sufficient optimality conditions","score":0.8690000176429749},{"id":"https://openalex.org/keywords/global-optimality","display_name":"global optimality","score":0.9539999961853027},{"id":"https://openalex.org/keywords/multiple-optimal-solutions","display_name":"multiple optimal solutions","score":0.6439999938011169},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"branch and bound","score":0.9340000152587891},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"combinatorial optimization","score":0.6610000133514404},{"id":"https://openalex.org/keywords/search-space-reduction","display_name":"search space reduction","score":0.6420000195503235}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.9638805985450745},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6652615070343018},{"id":"https://openalex.org/C151201525","wikidata":"https://www.wikidata.org/wiki/Q177239","display_name":"Limit (mathematics)","level":2,"score":0.6447473168373108},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.639169454574585},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.619429886341095},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6059939861297607},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.5407078862190247},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5228275060653687},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.48862701654434204},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.48768889904022217},{"id":"https://openalex.org/C94569963","wikidata":"https://www.wikidata.org/wiki/Q5165487","display_name":"Continuous knapsack problem","level":3,"score":0.4515603184700012},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.36056840419769287},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2782673239707947},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.05517718195915222},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","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/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.5784/24-1-56","doi":"https://doi.org/10.5784/24-1-56","is_oa":true,"landing_page_url":"https://doi.org/10.5784/24-1-56","pdf_url":"https://orion.journals.ac.za/pub/article/download/56/56","source":{"id":"https://openalex.org/S2737688452","display_name":"Orion/ORiON","issn_l":"0259-191X","issn":["0259-191X","2224-0004"],"is_oa":true,"is_in_doaj":true,"is_core":true,"listed_in":["cwts-core","dhet","doaj","jpps-2"],"host_organization":"https://openalex.org/P4310315349","host_organization_name":"Operations Research Society of South Africa","host_organization_lineage":["https://openalex.org/P4310315349"],"host_organization_lineage_names":["Operations Research Society of South Africa"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ORiON","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:5d28ac1ddcdc41c4ae1b3c2dca0ee55a","doi":null,"is_oa":false,"landing_page_url":"https://doaj.org/article/5d28ac1ddcdc41c4ae1b3c2dca0ee55a","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ORiON, Vol 24, Iss 1 (2008)","raw_type":"article"},{"id":"pmh:oai:scholar.sun.ac.za:10019.1/21965","doi":null,"is_oa":false,"landing_page_url":"http://hdl.handle.net/10019.1/21965","pdf_url":null,"source":{"id":"https://openalex.org/S4306400300","display_name":"SUNScholar (Stellenbosch University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I26092322","host_organization_name":"Stellenbosch University","host_organization_lineage":["https://openalex.org/I26092322"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article"}],"best_oa_location":{"id":"doi:10.5784/24-1-56","doi":"https://doi.org/10.5784/24-1-56","is_oa":true,"landing_page_url":"https://doi.org/10.5784/24-1-56","pdf_url":"https://orion.journals.ac.za/pub/article/download/56/56","source":{"id":"https://openalex.org/S2737688452","display_name":"Orion/ORiON","issn_l":"0259-191X","issn":["0259-191X","2224-0004"],"is_oa":true,"is_in_doaj":true,"is_core":true,"listed_in":["cwts-core","dhet","doaj","jpps-2"],"host_organization":"https://openalex.org/P4310315349","host_organization_name":"Operations Research Society of South Africa","host_organization_lineage":["https://openalex.org/P4310315349"],"host_organization_lineage_names":["Operations Research Society of South Africa"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ORiON","raw_type":"journal-article"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2166165083.pdf","grobid_xml":"https://content.openalex.org/works/W2166165083.grobid-xml"},"referenced_works_count":12,"referenced_works":["https://openalex.org/W1566552089","https://openalex.org/W1989546935","https://openalex.org/W1991609653","https://openalex.org/W1999244290","https://openalex.org/W2066671865","https://openalex.org/W2071609006","https://openalex.org/W2086427885","https://openalex.org/W2146315272","https://openalex.org/W2167391155","https://openalex.org/W3142300713","https://openalex.org/W6633770941","https://openalex.org/W6633973187"],"related_works":["https://openalex.org/W2055498515","https://openalex.org/W3197907922","https://openalex.org/W2320904627","https://openalex.org/W2066850897","https://openalex.org/W2118402343","https://openalex.org/W2087836010","https://openalex.org/W1523445389","https://openalex.org/W2042215625","https://openalex.org/W4252238151","https://openalex.org/W2170391791"],"abstract_inverted_index":{"In":[0],"this":[1,58],"paper":[2],"the":[3,18,29,53,75,88,104,109,117,135,140,146,149,167,175],"efficient":[4],"solvability":[5],"of":[6,9,17,57,71,87,98,143,170],"a":[7,40],"class":[8],"nonlinear":[10],"knapsack":[11,125],"problems":[12,101,126],"are":[13,81],"investigated":[14],"by":[15],"means":[16],"problem's":[19],"necessary":[20,76,105,136,147],"and":[21],"sufficient":[22,37],"conditions.":[23,137],"It":[24],"is":[25,33,48,94],"shown":[26,49],"that,":[27],"from":[28],"general":[30],"theory,":[31],"it":[32,47,60],"impossible":[34],"to":[35,42,65,84,96,115,129,139,166],"determine":[36],"conditions":[38,77,106,148],"for":[39,52,73],"solution":[41,92,151],"be":[43],"globally":[44],"optimal.":[45],"Furthermore,":[46],"that":[50,102],"even":[51],"smallest":[54],"possible":[55,64,91,132],"instance":[56],"problem":[59],"is,":[61],"in":[62,112,127],"general,":[63],"have":[66],"an":[67,113],"arbitrary":[68],"large":[69,141],"number":[70,142],"solutions":[72,133,144],"which":[74],"hold.":[78],"These":[79],"results":[80],"then":[82],"generalised":[83],"larger":[85],"instances":[86],"problem.":[89],"A":[90],"approach":[93,121,152,177],"applied":[95,165],"sets":[97],"randomly":[99],"generated":[100],"utilises":[103],"together":[107,160],"with":[108,161],"branch-and-bound":[110,158],"technique":[111],"attempt":[114],"limit":[116],"search":[118],"space.":[119],"This":[120,172],"solves":[122],"mixed":[123],"0/1":[124],"order":[128],"find":[130],"all":[131],"satisfying":[134,145],"Due":[138],"proposed":[150,176],"takes":[153],"substantially":[154],"longer":[155],"than":[156],"existing":[157],"algorithms":[159],"linear":[162],"enveloping":[163],"when":[164],"same":[168],"set":[169],"problems.":[171],"result":[173],"renders":[174],"not":[178],"very":[179],"efficient.":[180]},"counts_by_year":[],"updated_date":"2026-10-30T12:39:25.321706","created_date":"2016-06-24T00:00:00"}