HEURISTIC AND EXACT SOLUTION METHOD FOR CONVEX NONLINEAR KNAPSACK PROBLEM-Reference-Cited by-同舟云学术

HEURISTIC AND EXACT SOLUTION METHOD FOR CONVEX NONLINEAR KNAPSACK PROBLEM

Published:2012-10 Issue:05 Volume:29 Page:1250031
ISSN:0217-5959
Container-title:Asia-Pacific Journal of Operational Research
language:en
Short-container-title:Asia Pac. J. Oper. Res.

Author:

ZHANG BIN¹,CHEN BO²

Affiliation:

1. Lingnan College, Sun Yat-Sen University, Guangzhou 510275, P. R. China

2. School of Management, Hefei University of Technology, Hefei, Anhui 230009, P. R. China

Abstract

In this paper, we consider a class of convex nonlinear knapsack problems in which all decision variables are integer and the objective and knapsack functions are nonlinear. This generalized problem is characterized by positive marginal cost (PMC) and increasing marginal loss-cost ratio (IMLCR). By analyzing the structural properties of the problem, we develop an efficient heuristic and propose search and branching rules to improve the branch and bound method for solving exact solution. Numerical study is done for showing the effectiveness of the proposed heuristic and the modified branch and bound method.

Publisher

World Scientific Pub Co Pte Lt

Subject

Management Science and Operations Research,Management Science and Operations Research

Link

https://www.worldscientific.com/doi/pdf/10.1142/S0217595912500315

Reference27 articles.

1. Exact, approximate, and generic iterative models for the multi-product Newsboy problem with budget constraint

2. Disaggregation and Resource Allocation Using Convex Knapsack Problems with Bounded Variables

3. Nonlinear integer programming for optimal allocation in stratified sampling

4. The Nonlinear Resource Allocation Problem

5. A Branch and Bound Algorithm for Integer Quadratic Knapsack Problems

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Integer knapsack problems with profit functions of the same value range;4OR-Q J OPER RES;2023

2. Relaxations and heuristics for the multiple non-linear separable knapsack problem;Computers & Operations Research;2018-05

3. Reformulation and solution approach for non-separable integer quadratic programs;Journal of the Operational Research Society;2015-08

4. Algorithms for the continuous nonlinear resource allocation problem—New implementations and numerical studies;European Journal of Operational Research;2015-06

5. Simple solution methods for separable mixed linear and quadratic knapsack problem;Applied Mathematical Modelling;2012-07