Heuristic algorithms for the general nonlinear separable knapsack problem

DOI10.1016/J.COR.2010.07.010MaRDI QIDQ709196zbMATH OpenOpenAlexFDO

Authors Claudia D'Ambrosio, Silvano Martello

Publication date 15 October 2010

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cor.2010.07.010

zbMATH Keywords

heuristiclocal searchmixed integer nonlinear programmingnonconvexitynonlinear knapsackseparable knapsack

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Mixed integer programming (90C11)

Recommendations

• Heuristics for the general multiple non-linear knapsack problem
• Relaxations and heuristics for the multiple non-linear separable knapsack problem
• HEURISTIC AND EXACT SOLUTION METHOD FOR CONVEX NONLINEAR KNAPSACK PROBLEM
• The nonlinear knapsack problem - algorithms and applications
• Heuristic algorithms for the multiple-choice multidimensional knapsack problem
• Heuristics for the 0-1 multidimensional knapsack problem
• A Solution Strategy for a Class of Nonlinear Knapsack Problems
• On a discrete nonlinear and nonseparable knapsack problem
• A note on a general nonlinear knapsack problem

Cites work

• scientific article; zbMATH DE number 44282 (Why is no real title available?)
• scientific article; zbMATH DE number 47153 (Why is no real title available?)
• scientific article; zbMATH DE number 544186 (Why is no real title available?)
• scientific article; zbMATH DE number 2107164 (Why is no real title available?)
• A Global-Optimization Algorithm for Mixed-Integer Nonlinear Programs Having Separable Non-convexity
• A unified method for a class of convex separable nonlinear knapsack problems
• Nonconvex piecewise linear knapsack problems
• Smart greedy procedure for solving a nonlinear knapsack class of reliability optimization problems
• The nonlinear knapsack problem - algorithms and applications

Cited in

(18)

• On a discrete nonlinear and nonseparable knapsack problem
• The problem of the compartmentalized knapsack: a proposal of three new heuristics
• Relaxations and heuristics for the multiple non-linear separable knapsack problem
• A branch-and-bound based heuristic algorithm for convex multi-objective MINLPs
• A heuristical solution method to separable nonlinear programming problems
• HEURISTIC AND EXACT SOLUTION METHOD FOR CONVEX NONLINEAR KNAPSACK PROBLEM
• Approximating single- and multi-objective nonlinear sum and product knapsack problems
• A nonlinear knapsack problem
• Integer knapsack problems with profit functions of the same value range
• Initial shipment decisions for new products at Zara
• A class of nonlinear nonseparable continuous Knapsack and multiple-choice knapsack problems
• On speed scaling via integer programming
• Lower and upper bounds for the non-linear generalized assignment problem
• Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems
• Special issue on knapsack problems and applications
• Heuristics for the general multiple non-linear knapsack problem
• On the product knapsack problem
• A nonlinear multidimensional knapsack problem in the optimal design of mixture experiments

Describes a project that uses

Uses Software

• Knapsack

This page was built for publication: Heuristic algorithms for the general nonlinear separable knapsack problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q709196)