Title of article
Heuristicalgorithmsforthegeneralnonlinearseparableknapsackproblem
Author/Authors
Claudia D’Ambrosio، نويسنده , , SilvanoMartello ، نويسنده ,
Issue Information
ماهنامه با شماره پیاپی سال 2011
Pages
9
From page
505
To page
513
Abstract
We considerthenonlinearknapsackproblemwithseparablenonconvexfunctions.Dependingonthe
assumptionontheintegralityofthevariables,thisproblemcanbemodeledasanonlinear
programmingorasa(mixed)integernonlinearprogrammingproblem.Inbothcases,thisclassof
problemsisverydifficulttosolve,bothfromatheoreticalandapracticalviewpoint.Weproposeafast
heuristicalgorithm,andalocalsearchpost-optimizationprocedure.Aseriesofcomputational
comparisonswithaheuristicmethodforgeneralnonconvexmixedintegernonlinearprogrammingand
with globaloptimizationmethodsshowsthattheproposedalgorithmsprovidehigh-qualitysolutions
withinveryshortcomputingtimes.
Keywords
Heuristic , Local search , Nonlinear Knapsack , Nonconvexity , Separable knapsack , Mixed integer nonlinear programming
Journal title
Computers and Operations Research
Serial Year
2011
Journal title
Computers and Operations Research
Record number
927875
Link To Document