Title of article :
Heuristicalgorithmsforthegeneralnonlinearseparableknapsackproblem
Author/Authors :
Claudia D’Ambrosio، نويسنده , , SilvanoMartello ، نويسنده ,
Issue Information :
ماهنامه با شماره پیاپی سال 2011
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
Journal title :
Computers and Operations Research
