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

Kamlesh Mathur, Harvey M. Salkin, Susumu Morito

研究成果: Article

38 引用 (Scopus)

抜粋

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.

元の言語English
ページ(範囲)155-160
ページ数6
ジャーナルOperations Research Letters
2
発行部数4
DOI
出版物ステータスPublished - 1983
外部発表Yes

ASJC Scopus subject areas

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

フィンガープリント A branch and search algorithm for a class of nonlinear knapsack problems' の研究トピックを掘り下げます。これらはともに一意のフィンガープリントを構成します。

  • これを引用