نتایج جستجو برای: P-Center

تعداد نتایج: 1504800  

Let $G$ be a bipartite graph. In this paper we consider the two kind of location problems namely $p$-center and $p$-median problems on bipartite graphs. The $p$-center and $p$-median problems asks to find a subset of vertices of cardinality $p$, so that respectively the maximum and sum of the distances from this set to all other vertices in $G$ is minimized. For each case we present some proper...

Journal: :iranian journal of optimization 0
jafar fathali department of mathematics, shahrood university of technology, university blvd., shahrood, iran nader jafari rad department of mathematics, shahrood university of technology, university blvd., shahrood, iran sadegh rahimi sherbaf department of mathematics, shahrood university of technology, university blvd., shahrood, iran

an extended star is a tree which has only one vertex with degree larger than two. the -center problem in a graph  asks to find a subset  of the vertices of  of cardinality  such that the maximum weighted distances from  to all vertices is minimized. in this paper we consider the -center problem on the unweighted extended stars, and present some properties to find solution.

Jafar Fathali, Nader Jafari Rad Sadegh Rahimi Sherbaf

An extended star is a tree which has only one vertex with degree larger than two. The -center problem in a graph  asks to find a subset  of the vertices of  of cardinality  such that the maximum weighted distances from  to all vertices is minimized. In this paper we consider the -center problem on the unweighted extended stars, and present some properties to find solution.

Hassan Shavandi, Majid Taghavi

Facility location decisions play a prominent role in strategic planning of many firms, companies and governmental organizations. Since in many real-world facility location problems, the data are subject to uncertainty, in this paper, we consider the P-center problem under uncertainty of demands. Using Bertsimas and Sim approach, we develop a robust model of the problem as an integer programming...

Hassan Shavandi, Majid Taghavi

Facility location decisions play a prominent role in strategic planning of many firms, companies and governmental organizations. Since in many real-world facility location problems, the data are subject to uncertainty, in this paper, we consider the P-center problem under uncertainty of demands. Using Bertsimas and Sim approach, we develop a robust model of the problem as an integer programming...

Journal: :international journal of group theory 2013
alireza abdollahi s. mohsen ghoraishi

a longstanding conjecture asserts that every finite nonabelian $p$-group admits a noninner automorphism of order $p$‎. ‎let $g$ be a finite nonabelian $p$-group‎. ‎it is known that if $g$ is regular or of nilpotency class $2$ or the commutator subgroup of $g$ is cyclic‎, ‎or $g/z(g)$ is powerful‎, ‎then $g$ has a noninner automorphism of order $p$ leaving either the center $z(g)$ or the frattin...

Journal: :international journal of group theory 0
alireza abdollahi university of isfahan s. mohsen ghoraishi university of isfahan

a longstanding conjecture asserts that every finite nonabelian $p$-group admits a noninner automorphism of order $p$. let $g$ be a finite nonabelian $p$-group. it is known that if $g$ is regular or of nilpotency class $2$ or the commutator subgroup of $g$ is cyclic, or $g/z(g)$ is powerful, then $g$ has a noninner automorphism of order $p$ leaving either the center $z(g)$ or the frattini subgro...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه یاسوج - دانشکده علوم پایه 1393

در این پایان نامه به بررسی ایدآل های اوّل و ابتدائی فازی و رادیکال های آنها می پردازیم. ابتدا به تعاریف اصلی و نتایج منطق فازی در فصل اوّل اشاره می کنیم و در فصل دوم به تعاریف و قضایای مربوط به مجموعه ها و ایدآل های فازی پرداخته، درنهایت در فصل سوم خصوصیات ایدآل های ابتدائی فازی ورادیکال آنها درحلقه های تعویض پذیرمورد بحث و بررسی قرارمی گیرد‎.‎ ایدآل ‎$a$‎ از ‎$r$‎ ایدآل ابتدائی فازی است اگر برا...

Journal: :Computers & Operations Research 2019

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید