Relaxations and heuristics for the multiple non-linear separable knapsack problem
From MaRDI portal
Publication:1652581
DOI10.1016/j.cor.2017.12.017zbMath1391.90512OpenAlexW2779055396MaRDI QIDQ1652581
Silvano Martello, Luca Mencarelli, Claudia D'Ambrosio
Publication date: 11 July 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/11585/683155
Mixed integer programming (90C11) Nonconvex programming, global optimization (90C26) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (7)
Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems ⋮ Lower and upper bounds for the non-linear generalized assignment problem ⋮ A threshold search based memetic algorithm for the disjunctively constrained knapsack problem ⋮ Integer knapsack problems with profit functions of the same value range ⋮ Approximating single- and multi-objective nonlinear sum and product knapsack problems ⋮ An optimization method to solve a fully intuitionistic fuzzy non-linear separable programming problem ⋮ A nonlinear multidimensional knapsack problem in the optimal design of mixture experiments
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Heuristic algorithms for the general nonlinear separable knapsack problem
- SCIP: solving constraint integer programs
- A unified method for a class of convex separable nonlinear knapsack problems
- The nonlinear knapsack problem - algorithms and applications
- Optimal sensitivity based on IPOPT
- Towards strong duality in integer programming
- Branching and bounds tighteningtechniques for non-convex MINLP
- HEURISTIC AND EXACT SOLUTION METHOD FOR CONVEX NONLINEAR KNAPSACK PROBLEM
This page was built for publication: Relaxations and heuristics for the multiple non-linear separable knapsack problem
