Approximate formulations for 0-1 knapsack sets

被引：30
|
作者：
Bienstock, Daniel [1 ]
机构：
[1] Columbia Univ, Dept IEOR, New York, NY 10027 USA
来源：
OPERATIONS RESEARCH LETTERS | 2008年 / 36卷 / 03期
关键词：
integer programming; approximation algorithms; lift-and-project;
D O I：
10.1016/j.orl.2007.09.003
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
We show that for each 0 < epsilon <= 1 there exists an extended formulation for the knapsack problem, of size polynomial in the number of variables, whose value is at most (1 + epsilon) times the value of the integer program. (C) 2007 Elsevier B.V. All rights reserved.
引用
收藏
页码：317 / 320
页数：4
相关论文
共 50 条
  • [31] Binary Aquila Optimizer for 0-1 knapsack problems
    Bas, Emine
    [J]. ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2023, 118
  • [32] RESOLUTION OF 0-1 KNAPSACK PROBLEM - COMPARISON OF METHODS
    FAYARD, D
    PLATEAU, G
    [J]. MATHEMATICAL PROGRAMMING, 1975, 8 (03) : 272 - 307
  • [33] An exact algorithm for 0-1 polynomial knapsack problems
    Sun, Xiaoling
    Sheng, Hongbo
    Li, Duan
    [J]. JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION, 2007, 3 (02) : 223 - 232
  • [34] Local Cuts for 0-1 Multidimensional Knapsack Problems
    Gu, Hanyu
    [J]. DATA AND DECISION SCIENCES IN ACTION, 2018, : 81 - 89
  • [35] LAGRANGIAN-RELAXATION - THE KNAPSACK 0-1 PROBLEM
    MACULAN, N
    [J]. INFOR, 1983, 21 (04) : 315 - 327
  • [36] Heuristics for the 0-1 min-knapsack problem
    Csirik, J.
    Frenk, J.B.G.
    Labbe, M.
    Zhang, S.
    [J]. Acta Cybernetica, 1991, 10 (1-2): : 15 - 20
  • [37] A hybrid heuristic for the 0-1 Knapsack Sharing Problem
    Haddar, Boukthir
    Khemakhem, Mahdi
    Hanafi, Said
    Wilbaut, Christophe
    [J]. EXPERT SYSTEMS WITH APPLICATIONS, 2015, 42 (10) : 4653 - 4666
  • [38] AN ALGORITHM FOR THE 0-1 EQUALITY KNAPSACK-PROBLEM
    RAM, B
    SARIN, S
    [J]. JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 1988, 39 (11) : 1045 - 1049
  • [39] TESTABLE HEURISTICS FOR THE 0-1 KNAPSACK-PROBLEM
    APOLLONI, B
    [J]. CYBERNETICS, 1991, 27 (02): : 215 - 225
  • [40] A PROGRAM FOR THE 0-1 MULTIPLE KNAPSACK-PROBLEM
    MARTELLO, S
    TOTH, P
    [J]. ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE, 1985, 11 (02): : 135 - 140
12345