Heuristic algorithms for the general nonlinear separable knapsack problem
From MaRDI portal
Publication:709196
DOI10.1016/j.cor.2010.07.010zbMath1231.90320OpenAlexW2085920657MaRDI QIDQ709196
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
local searchheuristicmixed integer nonlinear programmingnonconvexitynonlinear knapsackseparable knapsack
Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (12)
Initial Shipment Decisions for New Products at Zara ⋮ Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems ⋮ Relaxations and heuristics for the multiple non-linear separable knapsack problem ⋮ On the product knapsack problem ⋮ Lower and upper bounds for the non-linear generalized assignment problem ⋮ Integer knapsack problems with profit functions of the same value range ⋮ Approximating single- and multi-objective nonlinear sum and product knapsack problems ⋮ Heuristics for the general multiple non-linear knapsack problem ⋮ A branch-and-bound based heuristic algorithm for convex multi-objective MINLPs ⋮ Special issue on knapsack problems and applications ⋮ On speed scaling via integer programming ⋮ A nonlinear multidimensional knapsack problem in the optimal design of mixture experiments
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A unified method for a class of convex separable nonlinear knapsack problems
- Nonconvex piecewise linear knapsack problems
- The nonlinear knapsack problem - algorithms and applications
- Smart greedy procedure for solving a nonlinear knapsack class of reliability optimization problems
- A Global-Optimization Algorithm for Mixed-Integer Nonlinear Programs Having Separable Non-convexity
This page was built for publication: Heuristic algorithms for the general nonlinear separable knapsack problem