WORST-CASE ANALYSIS OF THE SET-UNION PROBLEM WITH EXTENDED BACKTRACKING

被引：4
|
作者：
GAMBOSI, G
ITALIANO, GF
TALAMO, M
机构：
[1] UNIV ROME LA SAPIENZA,DIPARTIMENTO INFORMAT & SISTEMIST,VIA BUONARROTI 12,I-00185 ROME,ITALY
[2] UNIV SALERNO,DIPARTIMENTO INFORMAT & APPLICAZIONI,I-84100 SALERNO,ITALY
来源：
THEORETICAL COMPUTER SCIENCE | 1989年 / 68卷 / 01期
关键词：
D O I：
10.1016/0304-3975(89)90119-9
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
引用
收藏
页码：57 / 70
页数：14
相关论文
共 50 条
  • [21] Worst-case analysis
    Mancini, R
    EDN, 1999, 44 (13) : 24 - 24
  • [22] An Extended Framework for Worst-case Throughput Analysis with Router Constraint
    Mohan, Vineeth
    Hsu, Wenjing
    Zhang, Wei
    Wu, Xiaowen
    2014 IEEE ASIA PACIFIC CONFERENCE ON CIRCUITS AND SYSTEMS (APCCAS), 2014, : 691 - 694
  • [23] Exploring Initialization Strategies for Metaheuristic Optimization: Case Study of the Set-Union Knapsack Problem
    Garcia, Jose
    Leiva-Araos, Andres
    Crawford, Broderick
    Soto, Ricardo
    Pinto, Hernan
    MATHEMATICS, 2023, 11 (12)
  • [24] The Local Branching as a Learning Strategy in the Evolutionary Algorithm: The Case of the Set-Union Knapsack Problem
    Dahmani, Isma
    Ferroum, Meriem
    Hifi, Mhand
    JOURNAL OF ADVANCES IN INFORMATION TECHNOLOGY, 2022, 13 (03) : 259 - 264
  • [25] A MODIFIED GREEDY HEURISTIC FOR THE SET COVERING PROBLEM WITH IMPROVED WORST-CASE BOUND
    GOLDSCHMIDT, O
    HOCHBAUM, DS
    YU, G
    INFORMATION PROCESSING LETTERS, 1993, 48 (06) : 305 - 310
  • [26] Improved worst-case complexity for the MIN 3-SET COVERING problem
    Della Croce, Federico
    Escoffier, Bruno
    Paschos, Vangelis Th.
    OPERATIONS RESEARCH LETTERS, 2007, 35 (02) : 205 - 210
  • [27] Kernel based tabu search for the Set-union Knapsack Problem
    Wei, Zequn
    Hao, Jin-Kao
    EXPERT SYSTEMS WITH APPLICATIONS, 2021, 165
  • [28] Updatable Private Set Intersection Revisited: Extended Functionalities, Deletion, and Worst-Case Complexity
    Badrinarayanan, Saikrishna
    Miao, Peihan
    Shi, Xinyi
    Tromanhauser, Max
    Zeng, Ruida
    ADVANCES IN CRYPTOLOGY - ASIACRYPT 2024, PT VI, 2025, 15489 : 200 - 233
  • [29] WORST-CASE ANALYSIS OF HEURISTICS FOR THE LOCAL MICROCODE OPTIMIZATION PROBLEM
    BOTTCHER, A
    LAWITZKY, G
    SIMON, HU
    OPERATIONS RESEARCH LETTERS, 1988, 7 (03) : 127 - 130
  • [30] Additive bounding, worst-case analysis, and the breakpoint median problem
    Caprara, A
    SIAM JOURNAL ON OPTIMIZATION, 2002, 13 (02) : 508 - 519
12345