A fully polynomial time approximation scheme for minimum cost-reliability ratio problems
نویسندگان
چکیده
منابع مشابه
A Fully Polynomial Time Approximation Scheme for Packing While Traveling
Understanding the interactions between different combinatorial optimisation problems in real-world applications is a challenging task. Recently, the traveling thief problem (TTP), as a combination of the classical traveling salesperson problem and the knapsack problem, has been introduced to study these interactions in a systematic way. We investigate the underlying non-linear packing while tra...
متن کاملA Polynomial Time Approximation Scheme for Euclidean Minimum Cost k-Connectivity
We present polynomial-time approximation schemes for the problem of finding a minimum-cost k-connected Euclidean graph on a finite point set in R. The cost of an edge in such a graph is equal to the Euclidean distance between its endpoints. Our schemes use Steiner points. For every given c > 1 and a set S of n points in R, a randomized version of our scheme finds an Euclidean graph on a superse...
متن کاملAn Asymptotic Fully Polynomial Time Approximation Scheme for Bin Covering
In the bin covering problem there is a group L=(a1; : : : ; an) of items with sizes s̃(ai)∈ (0; 1), and the goal is to 6nd a packing of the items into bins to maximize the number of bins that receive items of total size at least 1. This is a dual problem to the classical bin packing problem. In this paper we present the 6rst asymptotic fully polynomial-time approximation scheme for the problem. ...
متن کاملFully Polynomial Time Approximation Schemes for Time-Cost Tradeoff Problems in Series-Parallel Project Networks
We consider the deadline problem and budget problem of the nonlinear time-cost tradeoff project scheduling model in a series-parallel activity network. We develop fully polynomial time approximation schemes for both problems using K-approximation sets and functions, together with series and parallel reductions.
متن کاملFully polynomial time approximation schemes (FPTAS) for some counting problems
In this thesis we develop FPTASs for the counting problems of m−tuples, contingency tables with two rows, and 0/1 knapsack. For the problem of counting m−tuples, we design two algorithms, one is strongly polynomial. As far as we know, these are the first FPTASs for this problem. For the problem of counting contingency tables we improve significantly over the running time of existing algorithms....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1992
ISSN: 0166-218X
DOI: 10.1016/0166-218x(92)90038-c