APPROXIMATION SCHEMES FOR THE SUBSET SUM PROBLEM - SURVEY AND EXPERIMENTAL-ANALYSIS

被引:8
|
作者
MARTELLO, S
TOTH, P
机构
[1] Univ of Bologna, Dipartimento di, Elettronica, Informatica e, Sistemistica, Bologna, Italy, Univ of Bologna, Dipartimento di Elettronica, Informatica e Sistemistica, Bologna, Italy
关键词
D O I
10.1016/0377-2217(85)90115-8
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
8
引用
收藏
页码:56 / 69
页数:14
相关论文
共 50 条
  • [21] Dynamic combinatorial optimisation problems: an analysis of the subset sum problem
    Rohlfshagen, Philipp
    Yao, Xin
    SOFT COMPUTING, 2011, 15 (09) : 1723 - 1734
  • [22] O((log n)2) Time Online Approximation Schemes for Bin Packing and Subset Sum Problems
    Ding, Liang
    Fu, Bin
    Fu, Yunhui
    Lu, Zaixin
    Zhao, Zhiyu
    FRONTIERS IN ALGORITHMICS, 2010, 6213 : 250 - +
  • [23] ON THE SUBSET SUM PROBLEM IN BRANCH GROUPS
    Nikolaev, Andrey
    Ushakov, Alexander
    GROUPS COMPLEXITY CRYPTOLOGY, 2020, 12 (01)
  • [24] The equal–sum–free subset problem
    Gábor Bacsó
    Zsolt Tuza
    Acta Scientiarum Mathematicarum, 2020, 86 : 73 - 79
  • [25] Subset sum problem in polycyclic groups
    Nikolaev, Andrey
    Ushakov, Alexander
    JOURNAL OF SYMBOLIC COMPUTATION, 2018, 84 : 84 - 94
  • [26] ON THE EQUAL-SUBSET-SUM PROBLEM
    WOEGINGER, GJ
    YU, ZL
    INFORMATION PROCESSING LETTERS, 1992, 42 (06) : 299 - 302
  • [27] An exact algorithm for the subset sum problem
    Soma, NY
    Toth, P
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2002, 136 (01) : 57 - 66
  • [28] Approximability of the Subset Sum Reconfiguration Problem
    Ito, Takehiro
    Demaine, Erik D.
    THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, TAMC 2011, 2011, 6648 : 58 - 69
  • [29] The Subset Sum Problem in Keno Modelling
    Sugden, Stephen J.
    NUMERICAL ANALYSIS AND APPLIED MATHEMATICS, 2008, 1048 : 526 - 529
  • [30] Approximability of the subset sum reconfiguration problem
    Takehiro Ito
    Erik D. Demaine
    Journal of Combinatorial Optimization, 2014, 28 : 639 - 654