抜粋
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' の研究トピックを掘り下げます。これらはともに一意のフィンガープリントを構成します。
これを引用
Mathur, K., Salkin, H. M., & Morito, S. (1983). A branch and search algorithm for a class of nonlinear knapsack problems. Operations Research Letters, 2(4), 155-160. https://doi.org/10.1016/0167-6377(83)90047-0