A branch and search algorithm for a class of nonlinear knapsack problems

Kamlesh Mathur, Harvey M. Salkin, Susumu Morito

Research output: Contribution to journalArticle

38 Citations (Scopus)

Abstract

This paper discusses a class of nonlinear knapsack problems where the objective function is quadratic. The method is a branch and search procedure which includes an efficient algorithm to find the continuous (relaxed) solution and a reduction rule which computes tight lower and upper bounds on the integer variables.

Original languageEnglish
Pages (from-to)155-160
Number of pages6
JournalOperations Research Letters
Volume2
Issue number4
DOIs
Publication statusPublished - 1983
Externally publishedYes

Fingerprint

Knapsack Problem
Search Algorithm
Nonlinear Problem
Upper and Lower Bounds
Branch
Efficient Algorithms
Objective function
Integer
Class
Knapsack problem
Lower bounds
Upper bound

Keywords

  • capital budgeting
  • integer programming
  • Nonlinear knapsack problem

ASJC Scopus subject areas

  • Management Science and Operations Research
  • Statistics, Probability and Uncertainty
  • Discrete Mathematics and Combinatorics
  • Modelling and Simulation

Cite this

A branch and search algorithm for a class of nonlinear knapsack problems. / Mathur, Kamlesh; Salkin, Harvey M.; Morito, Susumu.

In: Operations Research Letters, Vol. 2, No. 4, 1983, p. 155-160.

Research output: Contribution to journalArticle

Mathur, Kamlesh ; Salkin, Harvey M. ; Morito, Susumu. / A branch and search algorithm for a class of nonlinear knapsack problems. In: Operations Research Letters. 1983 ; Vol. 2, No. 4. pp. 155-160.
@article{55b9eda4a8a04577ac51722c86b7085d,
title = "A branch and search algorithm for a class of nonlinear knapsack problems",
abstract = "This paper discusses a class of nonlinear knapsack problems where the objective function is quadratic. The method is a branch and search procedure which includes an efficient algorithm to find the continuous (relaxed) solution and a reduction rule which computes tight lower and upper bounds on the integer variables.",
keywords = "capital budgeting, integer programming, Nonlinear knapsack problem",
author = "Kamlesh Mathur and Salkin, {Harvey M.} and Susumu Morito",
year = "1983",
doi = "10.1016/0167-6377(83)90047-0",
language = "English",
volume = "2",
pages = "155--160",
journal = "Operations Research Letters",
issn = "0167-6377",
publisher = "Elsevier",
number = "4",

}

TY - JOUR

T1 - A branch and search algorithm for a class of nonlinear knapsack problems

AU - Mathur, Kamlesh

AU - Salkin, Harvey M.

AU - Morito, Susumu

PY - 1983

Y1 - 1983

N2 - This paper discusses a class of nonlinear knapsack problems where the objective function is quadratic. The method is a branch and search procedure which includes an efficient algorithm to find the continuous (relaxed) solution and a reduction rule which computes tight lower and upper bounds on the integer variables.

AB - This paper discusses a class of nonlinear knapsack problems where the objective function is quadratic. The method is a branch and search procedure which includes an efficient algorithm to find the continuous (relaxed) solution and a reduction rule which computes tight lower and upper bounds on the integer variables.

KW - capital budgeting

KW - integer programming

KW - Nonlinear knapsack problem

UR - http://www.scopus.com/inward/record.url?scp=0020843380&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0020843380&partnerID=8YFLogxK

U2 - 10.1016/0167-6377(83)90047-0

DO - 10.1016/0167-6377(83)90047-0

M3 - Article

VL - 2

SP - 155

EP - 160

JO - Operations Research Letters

JF - Operations Research Letters

SN - 0167-6377

IS - 4

ER -