Výsledky vyhledávání - Advanced a-fully polynomial time approximation scheme

An Approach to Web Services Selection for Multiple Users Autor Zhu, Wenlong, Yin, Beibei, Gong, Siqian, Cai, Kai-Yuan

“…Web service selection for multiple users is an important aspect for achieving efficient operations for web service applications. Its aim is to select optimal…”
Získat plný text

Multi-Objective Quality-Driven Service Selection-A Fully Polynomial Time Approximation Scheme Autor Trummer, Immanuel, Faltings, Boi, Binder, Walter

“… We present the first approximation scheme for QDSS. It aims at the sweet spot between exact and randomized algorithms…”
Získat plný text

A fully polynomial-time approximation scheme for total completion time minimization on a single machine with DeJong's learning effect and an availability constraint Autor Bai, Mengzhuo, Zhao, Yufang

“… Firstly, a fully polynomial-time approximation scheme (FPTAS) was given for the problem, and afterwards that FPTAS was extended for the single-machine scheduling…”
Získat plný text

A Fully Polynomial-Time Approximation Scheme for Single-Item Stochastic Inventory Control with Discrete Demand Autor Halman, Nir, Klabjan, Diego, Mostagir, Mohamed, Orlin, Jim, Simchi-Levi, David

“… In this paper, we prove that this problem is intractable and design for it a fully polynomial-time approximation scheme…”
Získat plný text

When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)? Autor Woeginger, Gerhard J

“… involved cost and transition functions satisfy certain arithmetical and structural conditions, then the optimization problem automatically possesses a fully polynomial time approximation scheme (FPTAS…”
Získat plný text

A fully polynomial-time approximation scheme for a sequence 2-cluster partitioning problem Autor Kel’manov, A. V., Khamidullin, S. A., Khandeev, V. I.

“…We consider a strongly NP-hard problem of partitioning a finite sequence of points in Euclidean space into the two clustersminimizing the sum over both…”
Získat plný text

A Fully Polynomial-Time Approximation Scheme for Timing-Constrained Minimum Cost Layer Assignment Autor Hu, Shiyan, Li, Zhuo, Alpert, Charles J.

“… However, more advanced technologies (65 and 45 nm) provide relief as the number of metal layers continues to increase…”
Získat plný text

A fully polynomial approximation scheme for the weighted earliness-tardiness problem Autor Kovalyov, Mikhail Y, Kubiak, Wieslaw

“…A fully polynomial approximation scheme for the problem of scheduling n jobs on a single machine to minimize total weighted earliness and tardiness is presented…”
Získat plný text

Fully polynomial time approximation scheme for the pagination problem with hierarchical structure of tiles Autor Grange, Aristide, Kacem, Imed, Martin, Sébastien, Minich, Sarah

“…The pagination problem is described as follows. We have a set of symbols, a collection of subsets over these symbols (we call these subsets the tiles) and an…”
Získat plný text

A Note on a Fully Polynomial-Time Approximation Scheme for Minimizing Makespan of Deteriorating Jobs Autor Wan, Long

“… They presented a fully polynomial-time approximation scheme which is based on a dynamic programming…”
Získat plný text

A Fully Symmetric Oscillator-Based CMOS Ising Machine Architecture With Successive Approximation Sampling and Power Efficient Solution Refinement Autor Wu, Ke, Guo, Yuekang, Liu, Xiaoming, Chang, Zhongyuan, Yang, Howard C., Jin, Jing, Zhou, Jianjun

“…The Ising machine is regarded as a promising computing architecture for obtaining approximate solutions to some nondeterministic polynomial time hard (NP-hard) problems…”
Získat plný text

Fully polynomial-time approximation scheme for single machine scheduling with proportional-linear deteriorating jobs Autor Zhao, Chuanli, Hsu, Chou-Jung

“… The objective is to minimize the weighted number of tardy jobs. A pseudo-polynomial dynamic programming algorithm and a fully polynomial-time approximation scheme…”
Získat plný text

Approximation schemes for single-machine scheduling with a fixed maintenance activity to minimize the total amount of late work Autor Yin, Yunqiang, Xu, Jianyou, Cheng, T. C. E., Wu, Chin-Chia, Wang, Du-Juan

“…‐time approximation scheme for the problem. Finally, we conduct extensive numerical studies to evaluate the performance of the proposed algorithms…”
Získat plný text

Exact algorithms and approximation schemes for proportionate flow shop scheduling with step-deteriorating processing times Autor Shabtay, Dvir, Mor, Baruch

“…We study two scheduling problems in a proportionate flow shop environment, where job processing times are machine independent…”
Získat plný text

Penalty cost constrained identical parallel machine scheduling problem Autor Li, Weidong, Li, Jianping, Zhang, Xuejie, Chen, Zhibin

“…We consider a version of parallel machine scheduling with rejection. An instance of the problem is given by m identical parallel machines and a set of n independent jobs, with each job having a processing time and a penalty…”
Získat plný text

Approximation issues of fractional knapsack with penalties: a note Autor Kovalev, Sergey

“…], and values other than 0 and 1 are penalized. They state that the problem is NP-hard in the ordinary sense as a generalization of the classical 0-1 knapsack problem and develop a fully polynomial-time approximation scheme for the case of non…”
Získat plný text

A fully polynomial time approximation scheme for weighted job-dependent earliness-tardiness problem with agreeable ratios Autor Mondal, Sakib A.

“… Special cases of the problems have been shown to be NP-Complete. To the best of our knowledge, there is no fully polynomial approximation scheme (FPTAS) for this problem…”
Získat plný text

Single machine scheduling with release dates and rejection Autor Zhang, Liqi, Lu, Lingfa, Yuan, Jinjiang

“… Consequently, two special cases can be solved in polynomial-time. Finally, a 2-approximation algorithm and a fully polynomial-time approximation scheme are given…”
Získat plný text

Fully polynomial time approximation scheme for the weighted flow-time minimization on a single machine with a fixed non-availability interval Autor Kacem, Imed, Mahjoub, A. Ridha

“… In this paper, we propose a fully polynomial-time approximation scheme to minimize the total weighted completion time. The FPTAS has O ( n 2 / ε 2…”
Získat plný text

The Matching Problem Has No Fully Polynomial Size Linear Programming Relaxation Schemes Autor Braun, Gábor, Pokutta, Sebastian

“… (the LP equivalent of an Fully Polynomial-Time Approximation Scheme), which provides a sharp separation from the polynomial-size LP relaxation scheme…”
Získat plný text