Zobrazeno 1 - 10
of 18
pro vyhledávání: '"Tran Hoai Ngoc Nhan"'
Publikováno v:
Opuscula Mathematica, Vol 44, Iss 1, Pp 135-149 (2023)
The median location problem concerns finding locations of one or several new facilities that minimize the overall weighted distances from the existing to the new facilities. We address the problem of locating one new facility with a radius \(r\) on n
Externí odkaz:
https://doaj.org/article/ecbb54fe2745430fa8e4a59e4d8abc83
Autor:
Tran Hoai Ngoc Nhan1 tranhoaingocnhan@gmail.com, Nguyen Thanh Hung2 nthung@ctu.edu.vn, Kien Trung Nguyen2 trungkien@ctu.edu.vn
Publikováno v:
Opuscula Mathematica. 2024, Vol. 44 Issue 1, p135-149. 15p.
Publikováno v:
Asia-Pacific Journal of Operational Research.
The classical reverse 1-median problem on trees is to adjust the edge lengths within a budget so as to reduce the 1-median function at a predetermined vertex as much as possible. This paper concerns the corresponding problem with uncertain vertex wei
Publikováno v:
Yugoslav Journal of Operations Research; 2023, Vol. 33 Issue 2, p309-322, 14p
Publikováno v:
Journal of the Operations Research Society of China. 9:713-721
We address a variant of the continuous knapsack problem, where capacities regarding costs of items are given into account. We prove that the problem is NP-complete although the classical continuous knapsack problem is solvable in linear time. For the
Publikováno v:
Communications in Algebra. 48:833-846
The aim of the present paper is to introduce and study the dual concepts of weakly automorphism invariant modules and essential tightness. These notions are non-trivial generalizations of both weakly projectivity, dual automorphism invariant property
Publikováno v:
Discrete Mathematics, Algorithms and Applications. 14
We address in this paper the connected [Formula: see text]-median problem on complete multi-layered graphs. We first solve the corresponding 1-median problem on the underlying graph in linear time based on the structure of the induced path. For [Form
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
In this paper, we investigate some properties of SIP, SSP and CS-Rickart modules. We give equivalent conditions for SIP and SSP modules; establish connections between the class of semisimple artinian rings and the class of SIP rings. It shows that R
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::68e58bfe3c377a9b6d4bd226672afc46
https://openrepository.ru/article?id=683356
https://openrepository.ru/article?id=683356
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.