Heuristic algorithms for the general nonlinear separable knapsack problem
DOI10.1016/J.COR.2010.07.010zbMATH Open1231.90320OpenAlexW2085920657MaRDI QIDQ709196FDOQ709196
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
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
heuristiclocal searchmixed integer nonlinear programmingnonconvexitynonlinear knapsackseparable knapsack
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Mixed integer programming (90C11)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The nonlinear knapsack problem - algorithms and applications
- Title not available (Why is that?)
- A unified method for a class of convex separable nonlinear knapsack problems
- Nonconvex piecewise linear knapsack problems
- A Global-Optimization Algorithm for Mixed-Integer Nonlinear Programs Having Separable Non-convexity
- Smart greedy procedure for solving a nonlinear knapsack class of reliability optimization problems
Cited In (15)
- On a discrete nonlinear and nonseparable knapsack problem
- Relaxations and heuristics for the multiple non-linear separable knapsack problem
- A branch-and-bound based heuristic algorithm for convex multi-objective MINLPs
- HEURISTIC AND EXACT SOLUTION METHOD FOR CONVEX NONLINEAR KNAPSACK PROBLEM
- Approximating single- and multi-objective nonlinear sum and product knapsack problems
- Integer knapsack problems with profit functions of the same value range
- A nonlinear knapsack problem
- 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
- Initial Shipment Decisions for New Products at Zara
- 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
Uses Software
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)
