Continuous linear knapsack problems revisited

被引：0

作者：

Stefanov, Stefan M. ^{[1
]}

机构：

[1] South West Univ Neofit Rilski, Dept Math, Blagoevgrad 2700, Bulgaria

来源：

JOURNAL OF INFORMATION & OPTIMIZATION SCIENCES | 2023年 / 44卷 / 05期

关键词：

Knapsack problem; Linear programming; Convex programming; RESOURCE-ALLOCATION; CONVEX; ALGORITHM; SUBJECT; MINIMIZATION; CONSTRAINT;

D O I：

10.47974/JIOS-1184

中图分类号：

G25 [图书馆学、图书馆事业]; G35 [情报学、情报工作];

学科分类号：

1205 ; 120501 ;

摘要：

In this paper, the continuous linear knapsack problem is considered. Some preliminary results are formulated and proved, and theorems concerning the optimal solution of the considered problem are stated and proved.

引用

页码：909 / 922

页数：14

共 50 条

[21] APPROXIMATE ALGORITHMS FOR THE MULTIPLE-CHOICE CONTINUOUS KNAPSACK-PROBLEMS
IBARAKI, T
[J]. JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF JAPAN, 1980, 23 (01) : 28 - 63
[22] A pegging algorithm for separable continuous nonlinear knapsack problems with box constraints
Kim, Gitae
Wu, Chih-Hang
[J]. ENGINEERING OPTIMIZATION, 2012, 44 (10) : 1245 - 1259
[23] Exact algorithm for concave knapsack problems: Linear underestimation and partition method
Sun, XL
Wang, FL
Li, D
[J]. JOURNAL OF GLOBAL OPTIMIZATION, 2005, 33 (01) : 15 - 30
[24] Exact Algorithm for Concave Knapsack Problems: Linear Underestimation and Partition Method
X. L. Sun
F. L. Wang
D. Li
[J]. Journal of Global Optimization, 2005, 33 : 15 - 30
[25] The continuous knapsack set
Dash, Sanjeeb
Guenluek, Oktay
Wolsey, Laurence A.
[J]. MATHEMATICAL PROGRAMMING, 2016, 155 (1-2) : 471 - 496
[26] The continuous knapsack set
Sanjeeb Dash
Oktay Günlük
Laurence A. Wolsey
[J]. Mathematical Programming, 2016, 155 : 471 - 496
[27] A relation between the knapsack and group knapsack problems
Zhu, N
[J]. DISCRETE APPLIED MATHEMATICS, 1998, 87 (1-3) : 255 - 268
[28] Approximation algorithms on 0–1 linear knapsack problem with a single continuous variable
Chenxia Zhao
Xianyue Li
[J]. Journal of Combinatorial Optimization, 2014, 28 : 910 - 916
[29] An exact algorithm for the 0–1 linear knapsack problem with a single continuous variable
Geng Lin
Wenxing Zhu
M. M. Ali
[J]. Journal of Global Optimization, 2011, 50 : 657 - 673
[30] Mixed Integer Lifted Cover Inequalities for knapsack problems with a single continuous variable
Avella, Pasquale
Boccia, Maurizio
Mattia, Sara
[J]. 2013 5TH INTERNATIONAL CONFERENCE ON MODELING, SIMULATION AND APPLIED OPTIMIZATION (ICMSAO), 2013,

← 1 2 3 4 5 →