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 条

[31] A FULLY POLYNOMIAL-TIME APPROXIMATION SCHEME FOR MINIMUM COST-RELIABILITY RATIO PROBLEMS
KATOH, N
DISCRETE APPLIED MATHEMATICS, 1992, 35 (02) : 143 - 155
[32] Fully polynomial time approximation scheme for the total weighted tardiness minimization with a common due date
Kacem, Imed
DISCRETE APPLIED MATHEMATICS, 2010, 158 (09) : 1035 - 1040
[33] A fully polynomial time approximation scheme for scheduling on parallel identical two-stage openshops
Jianming Dong
Ruyan Jin
Jueliang Hu
Guohui Lin
Journal of Combinatorial Optimization, 2019, 37 : 668 - 684
[34] A fully polynomial-time approximation scheme for a sequence 2-cluster partitioning problem
Kel’manov A.V.
Khamidullin S.A.
Khandeev V.I.
Journal of Applied and Industrial Mathematics, 2016, 10 (02) : 209 - 219
[35] A deterministic fully polynomial time approximation scheme for counting integer knapsack solutions made easy
Halman, Nir
THEORETICAL COMPUTER SCIENCE, 2016, 645 : 41 - 47
[36] An improved fully polynomial randomized approximation scheme (FPRAS) for counting the number of Hamiltonian cycles in dense digraphs
Zhang, Jinshan
Bai, Fengshan
THEORETICAL COMPUTER SCIENCE, 2011, 412 (4-5) : 419 - 429
[37] A polynomial time approximation scheme for inferring evolutionary trees from quartet topologies and its application
Jiang, T
Kearney, P
Li, M
SIAM JOURNAL ON COMPUTING, 2001, 30 (06) : 1942 - 1961
[38] A Fully Polynomial-Time Approximation Scheme for Timing-Constrained Minimum Cost Layer Assignment
Hu, Shiyan
Li, Zhuo
Alpert, Charles J.
IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-EXPRESS BRIEFS, 2009, 56 (07) : 580 - 584
[39] FULLY POLYNOMIAL TIME APPROXIMATION SCHEME FOR TOTAL WEIGHTED TARDINESS MINIMIZATION UNDER A COMMON DUE DATE
Kacem, Imed
PROCEEDINGS OF THE 38TH INTERNATIONAL CONFERENCE ON COMPUTERS AND INDUSTRIAL ENGINEERING, VOLS 1-3, 2008, : 161 - 163
[40] A Fully Polynomial-Time Approximation Scheme for a Special Case of a Balanced 2-Clustering Problem
Kel'manov, Alexander
Motkova, Anna
DISCRETE OPTIMIZATION AND OPERATIONS RESEARCH, DOOR 2016, 2016, 9869 : 182 - 192

← 1 2 3 4 5 →