The Simultaneous Additive and Relative SysRem Algorithm
نویسندگان
چکیده
منابع مشابه
the algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولComparing Relative and Additive Contents of Return with Cash Recovery Rate
One of the goals of financial reporting is to provide the useful information in order to facilitate the decision making. Accounting information system is of high importance for the users to make specific decisions. The information should be analyzed to present the valuable information to the investors so that in this paper, the relative content and return additive with cash recovery have been a...
متن کاملDisconnectivity and Relative Positions in Simultaneous Embeddings
For two planar graphs G 1 = (V 1 , E 1 ) and G 2 = (V 2 , E 2 ) sharing a common subgraphG = G 1∩G 2 the problem Simultaneous Embedding with Fixed Edges (SEFE) asks whether they admit planar drawings such that the common graph is drawn the same. Previous algorithms only work for cases where G is connected, and hence do not need to handle relative positions of connected components. We consider t...
متن کاملThe fuzzy multi-depot vehicle routing problem with simultaneous pickup and delivery: Formulation and a heuristic algorithm
In this paper, the fuzzy multi-depot vehicle routing problem with simultaneous pickup and delivery (FMDVRP-SPD) is investigated. The FMDVRP-SPD is the problem of allocating customers to several depots, so that the optimal set of routes is determined simultaneously to serve the pickup and the delivery demands of each customer within scattered depots. In the problem, both pickup and delivery dema...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: EPJ Web of Conferences
سال: 2011
ISSN: 2100-014X
DOI: 10.1051/epjconf/20111101006