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 条
  • [1] Inapproximability and a polynomially solvable special case of a network improvement problem
    Zhang, JZ
    Yang, XG
    Cai, MC
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2004, 155 (01) : 251 - 257
  • [2] A well-solvable special case of the bounded knapsack problem
    Deineko, Vladimir G.
    Woeginger, Gerhard J.
    OPERATIONS RESEARCH LETTERS, 2011, 39 (02) : 118 - 120
  • [3] A polynomially solvable case of the pooling problem
    Natashia Boland
    Thomas Kalinowski
    Fabian Rigterink
    Journal of Global Optimization, 2017, 67 : 621 - 630
  • [4] A polynomially solvable case of the pooling problem
    Boland, Natashia
    Kalinowski, Thomas
    Rigterink, Fabian
    JOURNAL OF GLOBAL OPTIMIZATION, 2017, 67 (03) : 621 - 630
  • [5] An unbounded Sum-of-Squares hierarchy integrality gap for a polynomially solvable problem
    Adam Kurpisz
    Samuli Leppänen
    Monaldo Mastrolilli
    Mathematical Programming, 2017, 166 : 1 - 17
  • [6] An unbounded Sum-of-Squares hierarchy integrality gap for a polynomially solvable problem
    Kurpisz, Adam
    Leppanen, Samuli
    Mastrolilli, Monaldo
    MATHEMATICAL PROGRAMMING, 2017, 166 (1-2) : 1 - 17
  • [7] The bilinear assignment problem: complexity and polynomially solvable special cases
    Custic, Ante
    Sokol, Vladyslav
    Punnen, Abraham P.
    Bhattacharya, Binay
    MATHEMATICAL PROGRAMMING, 2017, 166 (1-2) : 185 - 205
  • [8] Polynomially solvable special cases of the quadratic bottleneck assignment problem
    Burkard, Rainer E.
    Rissner, Roswitha
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2011, 22 (04) : 845 - 856
  • [9] The bilinear assignment problem: complexity and polynomially solvable special cases
    Ante Ćustić
    Vladyslav Sokol
    Abraham P. Punnen
    Binay Bhattacharya
    Mathematical Programming, 2017, 166 : 185 - 205
  • [10] Polynomially solvable special cases of the quadratic bottleneck assignment problem
    Rainer E. Burkard
    Roswitha Rissner
    Journal of Combinatorial Optimization, 2011, 22 : 845 - 856
12345