Výsledky vyhledávání - "Ali Reza Sepasian"

Three-Dimensional Multi-UAV Placement and Resource Allocation for Energy-Efficient IoT Communication

Autor: Nima Nouri, Muhammad Jaseemuddin, Ali Reza Sepasian, Jamshid Abouei, Alagan Anpalagan, Konstantinos N. Plataniotis

Publikováno v: IEEE Internet of Things Journal. 9:2134-2152

This paper considers the problem of an unmanned aerial vehicle (UAV)-enabled cloud network under partial computation offloading scenario, where multiple UAV-mounted aerial base stations are employed to serve a group of remote Internet of Things groun

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::b6ce88a6ad5c2cf931c0faa2a00527c0
https://doi.org/10.1109/jiot.2021.3091166

Zobrazit plný text záznamu

Reverse 1-centre problem on trees under convex piecewise-linear cost function

Autor: Ali Reza Sepasian, Javad Tayyebi

Publikováno v: Optimization. 72:843-860

Given a network as well as a prescribed vertex s in which a facility is located, the aim of solving reverse 1-centre problems is to decrease edge lengths under a budget constraint in a way that the...

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::63bc15e668e422e02c8055c94faeed79
https://doi.org/10.1080/02331934.2021.1995730

Zobrazit plný text záznamu

Partial inverse min–max spanning tree problem

Autor: Javad Tayyebi, Ali Reza Sepasian

Publikováno v: Journal of Combinatorial Optimization. 40:1075-1091

This paper addresses a partial inverse combinatorial optimization problem, called the partial inverse min–max spanning tree problem. For a given weighted graph G and a forest F of the graph, the problem is to modify weights at minimum cost so that

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::700e3fc57cf3766d5aaa259c3ed85094
https://doi.org/10.1007/s10878-020-00656-3

Zobrazit plný text záznamu

On the stability of left δ-centralizers on Banach Lie triple systems

Autor: Ali Reza Sepasian, N. Ghobadipour

Publikováno v: Operators and Matrices. :797-807

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::e6ee468ac04f676f94391a2251d95881
https://doi.org/10.7153/oam-2019-13-56

Zobrazit plný text záznamu

Upgrading the 1-center problem with edge length variables on a tree

Autor: Ali Reza Sepasian

Publikováno v: Discrete Optimization. 29:1-17

This paper discusses upgrading the 1-center problem on networks, which tries to change the lengths of the edges within certain bounds and find the best place for 1-center with respect to the new lengths so that the objective value is minimized. As th

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::99d8764c4376d2d928da5a8b241fa306
https://doi.org/10.1016/j.disopt.2018.02.002

Zobrazit plný text záznamu

Upgrading min–max spanning tree problem under various cost functions

Autor: Ali Reza Sepasian, Ehsan Monabbati

Publikováno v: Theoretical Computer Science. 704:87-91

This paper addresses upgrading min–max spanning tree problem (MMST). Given a graph G ( V , E ) , the aim of this problem is to modify edge weights under certain limits and given budget so that the MMST with respect to perturbed graph improves as mu

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::e26142298b19598dc24b3255f67d4dfa
https://doi.org/10.1016/j.tcs.2017.08.006

Zobrazit plný text záznamu

Further Study on Reverse 1-Center Problem on Trees

Autor: Ali Reza Sepasian, Javad Tayyebi

Publikováno v: Asia-Pacific Journal of Operational Research. 37:2050034

This paper studies two types of reverse 1-center problems under uniform linear cost function where edge lengths are allowed to reduce. In the first type, the aim is that the objective value is bounded by a prescribed fixed value [Formula: see text] a

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::5362394050026f0063f3182cc55baf8f
https://doi.org/10.1142/s0217595920500347

Zobrazit plný text záznamu

The inverse 1-center problem on trees with variable edge lengths under Chebyshev norm and Hamming distance

Autor: Kien Trung Nguyen, Ali Reza Sepasian

Publikováno v: Journal of Combinatorial Optimization. 32:872-884

This paper addresses the problem of modifying the edge lengths of a tree in minimum total cost such that a prespecified vertex becomes the 1-center of the perturbed tree. This problem is called the inverse 1-center problem on trees. We focus on the p

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::9c7f15242b45b4071d3d5fef4bf8f14c
https://doi.org/10.1007/s10878-015-9907-5

Zobrazit plný text záznamu

Upgrading p-Median Problem on a Path

Autor: Freydoon Rahbarnia, Ali Reza Sepasian

Publikováno v: Journal of Mathematical Modelling and Algorithms in Operations Research. 14:145-157

Upgrading p-median problem is a problem of finding the best median of the given graph through modification of its parameters. The current paper develops a polynomial-time model to address this problem when the weights of vertices can be varying under

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::2d89f3dd2531320d22c1d75ae084f186
https://doi.org/10.1007/s10852-014-9265-9

Zobrazit plný text záznamu

An algorithm for the Inverse 1-median problem on trees with variable vertex weights and edge reductions

Autor: Freydoon Rahbarnia, Ali Reza Sepasian

Publikováno v: Optimization. :1-8

We investigate the inverse 1-median problem on trees where it is possible to change the weights of vertices or to reduce the length of an edge to zero. An algorithm is designed for solving this problem in case of symmetric bounds on the vertex weight

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::aadd6a4c53fbdbaac0160fa9422e2608
https://doi.org/10.1080/02331934.2013.783033

Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání