A polynomially solvable special case of the unbounded knapsack problem

被引：14

作者：

Zukerman, M ^{[1
]}

Jia, L

Neame, T

Woeginger, GJ

机构：

[1] Univ Melbourne, EEE Dept, ARC Special Res Ctr Ultra Broadband Informat Netw, Melbourne, Vic 3010, Australia

[2] Graz Tech Univ, Inst Math B, A-8010 Graz, Austria

[3] Univ Enschede, Dept Math, NL-7500 AE Enschede, Netherlands

来源：

OPERATIONS RESEARCH LETTERS | 2001年 / 29卷 / 01期

关键词：

knapsack; combinatorial optimization; integer programming; polynomial time algorithm; computational complexity;

D O I：

10.1016/S0167-6377(01)00076-1

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

We consider a special case of the unbounded knapsack problem that is characterized by a set of simple inequalities that relate item weights to item costs. We present an algorithm for this special case with time complexity linear in the number of items. (C) 2001 Published by Elsevier Science B.V.

引用

页码：13 / 16

页数：4

共 50 条

[31] On the complexity of the continuous unbounded knapsack problem with uncertain coefficients
Conde, E
OPERATIONS RESEARCH LETTERS, 2005, 33 (05) : 481 - 485
[32] Tight bounds for periodicity theorems on the unbounded Knapsack problem
Huang, Ping H.
Lawley, Mark
Morin, Thomas
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2011, 215 (02) : 319 - 324
[33] An empirical analysis of exact algorithms for the unbounded knapsack problem
Becker, Henrique
Buriol, Luciana S.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2019, 277 (01) : 84 - 99
[34] An Improved Unbounded-DP Algorithm for the Unbounded Knapsack Problem with Bounded Coefficients
Yang, Yang
MATHEMATICS, 2024, 12 (12)
[35] Some polynomially solvable subcases of the detailed routing problem in VLSI design
Recski, A
DISCRETE APPLIED MATHEMATICS, 2001, 115 (1-3) : 199 - 208
[36] The recoverable robust spanning tree problem with interval costs is polynomially solvable
Mikita Hradovich
Adam Kasperski
Paweł Zieliński
Optimization Letters, 2017, 11 : 17 - 30
[37] Polynomially unbounded product of two polynomially bounded operators
Petrovic, S
INTEGRAL EQUATIONS AND OPERATOR THEORY, 1997, 27 (04) : 473 - 477
[38] Polynomially unbounded product of two polynomially bounded operators
Srdjan Petrović
Integral Equations and Operator Theory, 1997, 27 : 473 - 477
[39] The recoverable robust spanning tree problem with interval costs is polynomially solvable
Hradovich, Mikita
Kasperski, Adam
Zielinski, Pawel
OPTIMIZATION LETTERS, 2017, 11 (01) : 17 - 30
[40] POLYNOMIALLY SOLVABLE CASES OF THE TRAVELING SALESMAN PROBLEM AND A NEW EXPONENTIAL NEIGHBORHOOD
BURKARD, RE
DEINEKO, VG
COMPUTING, 1995, 54 (03) : 191 - 211

← 1 2 3 4 5 →