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 条
  • [31] An Optical Solution for the Subset Sum Problem
    Hasan, Masud
    Hossain, S. M. Shabab
    Rahman, Md. Mahmudur
    Rahman, M. Sohel
    NATURAL COMPUTING, 2010, 2 : 165 - 173
  • [32] Dynamic Programming for the Subset Sum Problem
    Fujiwara, Hiroshi
    Watari, Hokuto
    Yamamoto, Hiroaki
    FORMALIZED MATHEMATICS, 2020, 28 (01): : 89 - 92
  • [34] A genetic algorithm for subset sum problem
    Wang, RL
    NEUROCOMPUTING, 2004, 57 : 463 - 468
  • [35] Approximability of the subset sum reconfiguration problem
    Ito, Takehiro
    Demaine, Erik D.
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2014, 28 (03) : 639 - 654
  • [36] Approximation schemes for a class of subset selection problems
    Pruhs, K
    Woeginger, GJ
    LATIN 2004: THEORETICAL INFORMATICS, 2004, 2976 : 203 - 211
  • [37] Approximation schemes for a class of subset selection problems
    Prubs, Kirk
    Woeginger, Gerhard J.
    THEORETICAL COMPUTER SCIENCE, 2007, 382 (02) : 151 - 156
  • [38] Efficient cryptographic schemes provably as secure as subset sum
    Impagliazzo, R
    Naor, M
    JOURNAL OF CRYPTOLOGY, 1996, 9 (04) : 199 - 216
  • [39] EFFICIENT CRYPTOGRAPHIC SCHEMES PROVABLY AS SECURE AS SUBSET SUM
    IMPAGLIAZZO, R
    NAOR, M
    30TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, 1989, : 236 - 241
  • [40] A BRIEF ANALYSIS OF EVOLUTIONARY ALGORITHMS FOR THE DYNAMIC MULTIOBJECTIVE SUBSET SUM PROBLEM
    Comsa, Iulia
    Grosan, Crina
    Yang, Shengxiang
    KEPT 2011: KNOWLEDGE ENGINEERING PRINCIPLES AND TECHNIQUES, 2011, : 177 - 184