Approximation algorithms for combinatorial multicriteria optimization problems
نویسندگان
چکیده
منابع مشابه
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...
متن کاملApproximation Algorithms for Combinatorial Optimization
In combinatorial optimization, the most important challenges are presented by problems belonging to the class NP-hard. For such problems no algorithm is known that can solve all instances in polynomial time. It is also strongly believed that no polynomial algorithm is capable of doing this. Although it is very difficult to solve exactly any of the NP-hard problems, some of them are amenable to ...
متن کاملDifferential Approximation Algorithms for Some Combinatorial Optimization Problems
We use a new approximation measure, the differential approximation ratio, to derive polynomial-time approximation algorithms for minimum set covering (for both weighted and unweighted cases), minimum graph coloring and bin-packing. We also propose differentialapproximation-ratio preserving reductions linking minimum coloring, minimum vertex covering by cliques, minimum edge covering by cliques ...
متن کاملApproximation Algorithms for Reliable Stochastic Combinatorial Optimization
We consider optimization problems that can be formulated as minimizing the cost of a feasible solution wx over an arbitrary combinatorial feasible set F ⊂ {0, 1}n. For these problems we describe a broad class of corresponding stochastic problems where the cost vector W has independent random components, unknown at the time of solution. A natural and important objective that incorporates risk in...
متن کاملApproximation algorithms for combinatorial optimization under uncertainty
Combinatorial optimization problems arise in many fields of industry and technology, where they are frequently used in production planning, transportation, and communication network design. Whereas in the context of classical discrete optimization it is usually assumed that the problem inputs are known, in many real-world applications some of the data may be subject to an uncertainty, often bec...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Transactions in Operational Research
سال: 2000
ISSN: 0969-6016,1475-3995
DOI: 10.1111/j.1475-3995.2000.tb00182.x