An ε-approximation scheme for combinatorial optimization problems with minimum variance criterion
نویسندگان
چکیده
منابع مشابه
An E-approximation Scheme for Minimum Variance Problems
Abstmct Minimum variance problem may arise when we want to allocate a given amount of resource as fairly as possible to a finite set of activities under certain constraints. More formally, it is described as follows. Given a finite set E, a subset S of RE, and a function he(x(e)) from a certain domain to R for each e E E (which represents the profit resulting from ailocating x(e) amount of reso...
متن کاملApproximation Techniques for Stochastic Combinatorial Optimization Problems
The focus of this thesis is on the design and analysis of algorithms for basic problems in Stochastic Optimization, speciVcally a class of fundamental combinatorial optimization problems where there is some form of uncertainty in the input. Since many interesting optimization problems are computationally intractable (NP-Hard), we resort to designing approximation algorithms which provably outpu...
متن کاملApproximation thresholds for combinatorial optimization problems
An NP-hard combinatorial optimization problem Π is said to have an approximation threshold if there is some t such that the optimal value of Π can be approximated in polynomial time within a ratio of t, and it is NP-hard to approximate it within a ratio better than t. We survey some of the known approximation threshold results, and discuss the pattern that emerges from
متن کاملApproximation Algorithms for Combinatorial Multicriteria Optimization Problems
The computational complexity of combinatorial multiple objective programming problems is investigated. INP-completeness and #P-completeness results are presented. Using two deenitions of approximability, general results are presented, which outline limits for approximation algorithms. The performance of the well known tree and Christoodes' heuristics for the TSP is investigated in the multicrit...
متن کاملCombinatorial optimization problems with uncertain costs and the OWA criterion
In this paper a class of combinatorial optimization problems with uncertain costs is discussed. The uncertainty is modeled by specifying a discrete scenario set containing K distinct cost scenarios. The Ordered Weighted Averaging (OWA for short) aggregation operator is applied to choose a solution. Some well known criteria used in decision making under uncertainty such as the maximum, minimum, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1992
ISSN: 0166-218X
DOI: 10.1016/0166-218x(92)90037-b