A minimization problem concerning subsets of a finite set
نویسندگان
چکیده
منابع مشابه
Generating all subsets of a finite set with disjoint unions
If X is an n-element set, we call a family G ⊂ PX a k-generator for X if every x ⊂ X can be expressed as a union of at most k disjoint sets in G. Frein, Lévêque and Sebő [10] conjectured that for n > 2k, the smallest k-generators for X are obtained by taking a partition of X into classes of sizes as equal as possible, and taking the union of the power-sets of the classes. We prove this conjectu...
متن کاملsolution of security constrained unit commitment problem by a new multi-objective optimization method
چکیده-پخش بار بهینه به عنوان یکی از ابزار زیر بنایی برای تحلیل سیستم های قدرت پیچیده ،برای مدت طولانی مورد بررسی قرار گرفته است.پخش بار بهینه توابع هدف یک سیستم قدرت از جمله تابع هزینه سوخت ،آلودگی ،تلفات را بهینه می کند،و هم زمان قیود سیستم قدرت را نیز برآورده می کند.در کلی ترین حالتopf یک مساله بهینه سازی غیر خطی ،غیر محدب،مقیاس بزرگ،و ایستا می باشد که می تواند شامل متغیرهای کنترلی پیوسته و گ...
A new method to determine a well-dispersed subsets of non-dominated vectors for MOMILP problem
Multi-objective optimization is the simultaneous consideration of two or more objective functions that are completely or partially inconflict with each other. The optimality of such optimizations is largely defined through the Pareto optimality. Multiple objective integer linear programs (MOILP) are special cases of multiple criteria decision making problems. Numerous algorithms have been desig...
متن کاملOn Filling Families of Finite Subsets of the Cantor Set
Let ε > 0 and F be a family of finite subsets of the Cantor set C. Following D. H. Fremlin, we say that F is ε-filling over C if F is hereditary and for every F ⊆ C finite there exists G ⊆ F such that G ∈ F and |G| ≥ ε|F |. We show that if F is ε-filling over C and C-measurable in [C], then for every P ⊆ C perfect there exists Q ⊆ P perfect with [Q] ⊆ F . A similar result for weaker versions of...
متن کاملA Local Branching Approach for the Set Covering Problem
The set covering problem (SCP) is a well-known combinatorial optimization problem. This paper investigates development of a local branching approach for the SCP. This solution strategy is exact in nature, though it is designed to improve the heuristic behavior of the mixed integer programming solver. The algorithm parameters are tuned by design of experiments approach. The proposed method is te...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1973
ISSN: 0012-365X
DOI: 10.1016/0012-365x(73)90074-5