Studies on optimum-path ratios in multicriteria De Novo programming problems
نویسندگان
چکیده
منابع مشابه
On solving possibilistic multi- objective De Novo linear programming
Multi-objective De Novo linear programming (MODNLP) is problem for designing optimal system by reshaping the feasible set (Fiala [3] ). This paper deals with MODNLP having possibilistic objective functions coefficients. The problem is considered by inserting possibilistic data in the objective functions coefficients. The solution of the problem is defined and established under the using of effi...
متن کاملDe-Novo Presentation of Histoid Leprosy on an Unusual Site
Histoid Leprosy (HL) is a rare variant of Lepromatous Leprosy, occurring in long-standing cases, mostly in a background of acquired drug resistance. Patients usually present with sudden onset multiple nodules and plaques, most often involving the skin and subcutaneous tissue of trunk and lower limbs. Here we report an unusual case of de novo (without any history of prior anti-leprotic therapy) ...
متن کاملFuzzy multi-stage De-Novo programming problem
The De-Novo programming problem proposed by Zeleny is well-known for its value on designing an optimal system by extending existed resources instead of finding the optimum in a given system with fixed resources. Since few papers are dedicated to explore the De-Novo programming problem with multiple stages and its resolution approach, the De-Novo programming problem is innovatively extended to a...
متن کاملPreliminary Studies on de novo Assembly with Short Reads
Recent development of next generation sequencing presents new computational challenges to assembly algorithms. Any effective and practical de novo assembly algorithm must confront issues of short read length, base-calling errors and enormous data size. In this report we present our effort to address these challenges in de novo assembly with short reads. Specifically we show that quality scores ...
متن کاملOptimum Path Packing on Wheels :
We show that, given a wheel with nonnegative edge lengths and pairs of terminals located on the wheel's outer cycle such that no two terminal pairs cross, then a path packing, i. e., a collection of edge disjoint paths connecting the given terminal pairs, of minimum length can be found in strongly polynomial time. Moreover, we exhibit for this case a system of linear inequalities that provides ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 1995
ISSN: 0898-1221
DOI: 10.1016/0898-1221(94)00247-i