Some fully polynomial time randomized approximation scheme based on an evolutionary algorithm

被引：0
|
作者：
Eremeev A.V. [1 ]
机构：
[1] Omsk Department of Sobolev Institute of Mathematics, Omsk 644099
来源：
Journal of Applied and Industrial Mathematics | 2011年 / 5卷 / 03期
基金：
俄罗斯基础研究基金会;
关键词：
approximate solution; approximation scheme; dynamic programming; evolutionary algorithm; randomization;
D O I：
10.1134/S1990478911030021
中图分类号：
学科分类号：
摘要：
Considering the class of discrete optimization problems that satisfy the Woeginger conditions of existence of a fully polynomial-time approximation scheme, we propose a fully polynomial-time randomized approximation scheme based on an evolutionary algorithm. © 2011 Pleiades Publishing, Ltd.
引用
收藏
页码：322 / 330
页数：8
相关论文
共 50 条
  • [21] A Fully Polynomial-Time Approximation Scheme for Speed Scaling with a Sleep State
    Antoniadis, Antonios
    Huang, Chien-Chung
    Ott, Sebastian
    ALGORITHMICA, 2019, 81 (09) : 3725 - 3745
  • [22] A new fully polynomial time approximation scheme for the interval subset sum problem
    Diao, Rui
    Liu, Ya-Feng
    Dai, Yu-Hong
    JOURNAL OF GLOBAL OPTIMIZATION, 2017, 68 (04) : 749 - 775
  • [23] Implementing a fully polynomial time approximation scheme for all terminal network reliability
    Karger, DR
    Tai, RP
    PROCEEDINGS OF THE EIGHTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 1997, : 334 - 343
  • [24] Scheduling malleable parallel tasks: An asymptotic fully polynomial time approximation scheme
    Jansen, K
    ALGORITHMICA, 2004, 39 (01) : 59 - 81
  • [25] A Fully Polynomial Time Approximation Scheme for Timing Driven Minimum Cost Buffer Insertion
    Hu, Shiyan
    Li, Zhuo
    Alpert, Charles J.
    DAC: 2009 46TH ACM/IEEE DESIGN AUTOMATION CONFERENCE, VOLS 1 AND 2, 2009, : 424 - +
  • [26] A Note on a Fully Polynomial-Time Approximation Scheme for Minimizing Makespan of Deteriorating Jobs
    Wan, Long
    MATHEMATICAL PROBLEMS IN ENGINEERING, 2013, 2013
  • [27] Scheduling malleable parallel tasks: An asymptotic fully polynomial-time approximation scheme
    Jansen, K
    ALGORITHMS-ESA 2002, PROCEEDINGS, 2002, 2461 : 562 - 573
  • [28] A fully polynomial time approximation scheme for a stop schedule of a transportation line without branches
    Jeong, In-Jae
    ENGINEERING OPTIMIZATION, 2024,
  • [29] A Fully Polynomial Approximation Scheme for Minimizing Makespan of Deteriorating Jobs
    Kovalyov M.Y.
    Kubiak W.
    Journal of Heuristics, 1998, 3 (4) : 287 - 297
  • [30] A fully polynomial time approximation scheme for scheduling on parallel identical two-stage openshops
    Dong, Jianming
    Jin, Ruyan
    Hu, Jueliang
    Lin, Guohui
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2019, 37 (02) : 668 - 684
12345