Journal
COMPUTERS & OPERATIONS RESEARCH
Volume 93, Issue -, Pages 79-89Publisher
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cor.2017.12.017
Keywords
Multiple non-linear knapsack problem; Heuristic algorithms; Surrogate relaxation
Categories
Funding
- MIUR-Italy
- Air Force Office of Scientific Research [FA9550-17-1-0067]
- Mixed Integer Nonlinear Optimization (MINO) Initial Training Network (ITN) under the Marie Curie 7th European Framework Programme [316647]
Ask authors/readers for more resources
We consider the multiple non-linear knapsack problem with separable non-convex functions. The problem, which can be modeled as a (mixed) integer non-linear program, is extremely difficult to solve in practice. We present a fast heuristic algorithm, based on constructive techniques, surrogate relaxations, and local search improvements. Computational comparisons with exact and heuristic methods for general non-convex mixed integer non-linear programs show that the proposed approach provides good-quality solutions within small computing times. (C) 2017 Elsevier Ltd. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available