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 条

[1] A Randomized Fully Polynomial-time Approximation Scheme for Weighted Perfect Matching in the Plane
Abd El-Latif, Yasser M.
Ali, Salwa M.
Essa, Hanaa A. E.
Khamis, Soheir M.
INTERNATIONAL JOURNAL OF ADVANCED COMPUTER SCIENCE AND APPLICATIONS, 2012, 3 (11) : 139 - 144
[2] A randomized fully polynomial time approximation scheme for the all-terminal network reliability problem
Karger, DR
SIAM REVIEW, 2001, 43 (03) : 499 - 522
[3] A randomized fully polynomial time approximation scheme for the all-terminal network reliability problem
Karger, DR
SIAM JOURNAL ON COMPUTING, 1999, 29 (02) : 492 - 514
[4] An asymptotic fully polynomial time approximation scheme for bin covering
Jansen, K
Solis-Oba, R
ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2002, 2518 : 175 - 186
[5] A fully polynomial time approximation scheme for the Replenishment Storage problem
Hochbaum, Dorit S.
Rao, Xu
OPERATIONS RESEARCH LETTERS, 2020, 48 (06) : 835 - 839
[6] A New Fully Polynomial Time Approximation Scheme for the Knapsack Problem
Hans Kellerer
Ulrich Pferschy
Journal of Combinatorial Optimization, 1999, 3 : 59 - 71
[7] A Fully Polynomial Time Approximation Scheme for Packing While Traveling
Neumann, Frank
Polyakovskiy, Sergey
Skutella, Martin
Stougie, Leen
Wu, Junhua
ALGORITHMIC ASPECTS OF CLOUD COMPUTING (ALGOCLOUD 2018), 2019, 11409 : 59 - 72
[8] An asymptotic fully polynomial time approximation scheme for bin covering
Jansen, K
Solis-Oba, R
THEORETICAL COMPUTER SCIENCE, 2003, 306 (1-3) : 543 - 551
[9] A new fully polynomial time approximation scheme for the knapsack problem
Kellerer, H
Pferschy, U
JOURNAL OF COMBINATORIAL OPTIMIZATION, 1999, 3 (01) : 59 - 71
[10] A Polynomial Time Approximation Scheme for a Single Machine Scheduling Problem Using a Hybrid Evolutionary Algorithm
Mitavskiy, Boris
He, Jun
2012 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2012,

← 1 2 3 4 5 →