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 条
  • [41] POLYNOMIALLY SOLVABLE SATISFIABILITY PROBLEMS
    GALLO, G
    SCUTELLA, MG
    INFORMATION PROCESSING LETTERS, 1988, 29 (05) : 221 - 227
  • [42] The knapsack problem with special neighbor constraints
    Steffen Goebbels
    Frank Gurski
    Dominique Komander
    Mathematical Methods of Operations Research, 2022, 95 : 1 - 34
  • [43] The linking set problem: A polynomial special case of the multiple-choice knapsack problem
    Agra A.
    Requejo C.
    Journal of Mathematical Sciences, 2009, 161 (6) : 919 - 929
  • [44] The knapsack problem with special neighbor constraints
    Goebbels, Steffen
    Gurski, Frank
    Komander, Dominique
    MATHEMATICAL METHODS OF OPERATIONS RESEARCH, 2022, 95 (01) : 1 - 34
  • [45] Solving Unbounded Knapsack Problem Based on Quantum Genetic Algorithms
    Chen, Rung-Ching
    Huang, Yun-Hou
    Lin, Ming-Hsien
    INTELLIGENT INFORMATION AND DATABASE SYSTEMS, PT I, PROCEEDINGS, 2010, 5990 : 339 - 349
  • [46] UKP5: A New Algorithm for the Unbounded Knapsack Problem
    Becker, Henrique
    Buriol, Luciana S.
    EXPERIMENTAL ALGORITHMS, SEA 2016, 2016, 9685 : 50 - 62
  • [47] Classes of subcubic planar graphs for which the independent set problem is polynomially solvable
    Malyshev D.S.
    Journal of Applied and Industrial Mathematics, 2013, 7 (4) : 537 - 548
  • [48] SMALL AND LARGE TSP - 2 POLYNOMIALLY SOLVABLE CASES OF THE TRAVELING SALESMAN PROBLEM
    VANDAL, R
    VANDERVEEN, JAA
    SIERKSMA, G
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1993, 69 (01) : 107 - 120
  • [49] Online Unbounded Knapsack
    Boeckenhauer, Hans-Joachim
    Gehnen, Matthias
    Hromkovic, Juraj
    Klasing, Ralf
    Komm, Dennis
    Lotze, Henri
    Mock, Daniel
    Rossmanith, Peter
    Stocker, Moritz
    THEORY OF COMPUTING SYSTEMS, 2025, 69 (01)
  • [50] Polynomially solvable personnel rostering problems
    Smet, Pieter
    Brucker, Peter
    De Causmaecker, Patrick
    Vanden Berghe, Greet
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2016, 249 (01) : 67 - 75
12345