Search Results - fully polynomial approximation algorithm

Nonconvex piecewise linear knapsack problems by Kameshwaran, S., Narahari, Y.

“…This paper considers the minimization version of a class of nonconvex knapsack problems with piecewise linear cost structure. The items to be included in the…”
Get full text

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

“… We first discuss the approximability of the problem. We then develop two pseudo‐polynomial dynamic programming algorithms and a fully polynomial…”
Get full text

On fault-tolerant path optimization under QoS constraint in multi-channel wireless networks by Zhang, Shurong, Chen, Lin, Yang, Weihua

“…In multi-channel wireless networks, a fundamental problem is to find node-disjoint paths minimising global cost or the maximum individual path cost, under the…”
Get full text

QoS routing algorithms using fully polynomial time approximation scheme by Jun Huang, Tanaka, Yoshiaki

“… Developing QoS routing algorithm in the network is an important open topic. This paper investigates the QoS routing related problems and proposes a Fully Polynomial Time Approximation Scheme (FPTAS) for QoS routing…”
Get full text

Two‐agent scheduling with linear resource‐dependent processing times by Wang, Dujuan, Yu, Yugang, Qiu, Huaxin, Yin, Yunqiang, Cheng, T. C. E.

“…This paper considers a two‐agent scheduling problem with linear resource‐dependent processing times, in which each agent has a set of jobs that compete with…”
Get full text

The Fully Polynomial Approximation Algorithm for the 0-1 Knapsack Problem by Liu, Yingjie

“…A modified fast approximation algorithm for the 0-1 knapsack problem with improved complexity is presented, based on the schemes of Ibarra, Kim and Babat…”
Get full text

A PTAS for the cardinality constrained covering with unit balls by Ghasemi, Taha, Razzazi, Mohammadreza

“… Developing a constant-factor approximation algorithm for this problem is an old open problem…”
Get full text

Single machine scheduling with release dates and rejection by 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…”
Get full text

A Robust Service Mapping Scheme for Multi-Tenant Clouds by Wang, Jingzhou, Zhao, Gongming, Xu, Hongli, Zhai, Yutong, Zhang, Qianyu, Huang, He, Yang, Yongqiang

“…In a multi-tenant cloud, cloud vendors provide services (\eg, elastic load-balancing, virtual private networks) on service nodes for tenants. Thus, the mapping…”
Get full text

Order acceptance and scheduling with delivery under generalized parameters by Lu, Lingfa, Ou, Jinwen, Yu, Xue, Zhang, Liqi

“…Inspired by the concept of generalized due dates introduced by Hall ( IIE Transactions , 18(2), 220–222), in this article we first define four new generalized…”
Get full text

The prize-collecting single machine scheduling with bounds and penalties by Hu, Guojun, Pan, Pengxiang, Liu, Suding, Yang, Ping, Xie, Runtao

“…This study investigates the prize-collecting single machine scheduling with bounds and penalties (PC-SMS-BP). In this problem, a set of n jobs and a single…”
Get full text

Efficient computation of evacuation routes on a three-dimensional geometric network by Tang, Huajun, Elalouf, Amir, Levner, Eugene, Cheng, T.C.E.

“…•We prove the problem to be NP-hard.•We suggest the exact dynamic programming algorithm and two polynomial time approximation algorithms…”
Get full text

Two-agent scheduling on a single machine with release dates by Liu, Peihai, Gu, Manzhan, Li, Ganggang

“…•A Fully Polynomial Time Approximation Schemes (FPTAS) is presented.•A mix integer linear programming formulation is established and it can be solved by CPLEX effectively…”
Get full text

The Ground-Set-Cost Budgeted Maximum Coverage Problem by van Heuven van Staereling, Irving, de Keijzer, Bart, Schäfer, Guido

“…We study the following natural variant of the budgeted maximum coverage problem: We are given a budget B and a hypergraph , where each vertex has a…”
Get full text

Approximation algorithm for the balanced 2-connected k-partition problem by Wu, Di, Zhang, Zhao, Wu, Weili

“…=2, a 4/3-approximation algorithm is given for BC2P2 on 4-connected interval graphs…”
Get full text

Approximation algorithms for drone delivery scheduling with a fixed number of drones by Jana, Saswata, Mandal, Partha Sarathi

“… This paper proposes an optimal pseudo-polynomial algorithm and a fully polynomial time approximation scheme (FPTAS…”
Get full text

A Dynamic Programming Approach for the Decentralized Control of Energy Retrofit in Large-Scale Street Lighting Systems by Carli, Raffaele, Dotoli, Mariagrazia

“… The proposed solution relies on a decentralized control algorithm that combines discrete dynamic programming with additive decomposition and value functions approximation…”
Get full text

Two-machine flow-shop scheduling with rejection by Shabtay, Dvir, Gasper, Nufar

“… algorithm and a fully polynomial time approximation scheme (FPTAS). We also study the problem of finding the entire set of Pareto-optimal points…”
Get full text

On efficient algorithms for finding efficient salvo policies by Ee, Martijn

“…We consider the salvo policy problem, in which there are k moments, called salvos, at which we can fire multiple missiles simultaneously at an incoming object…”
Get full text

Parallel-machine scheduling of deteriorating jobs with potential machine disruptions by Yin, Yunqiang, Wang, Yan, Cheng, T.C.E., Liu, Wenqi, Li, Jinhai

“…We consider parallel-machine scheduling of deteriorating jobs in a disruptive environment in which some of the machines will become unavailable due to…”
Get full text