Zobrazeno 1 - 10
of 1 659
pro vyhledávání: '"Minimum-cost flow problem"'
Autor:
Belkacem Salima Nait, Abbas Moncef
Publikováno v:
Foundations of Computing and Decision Sciences, Vol 48, Iss 3, Pp 313-329 (2023)
In this paper, we have done a rapid and very simple algorithm that resolves the multiple objective combinatorial optimization problem. This, by determining a basic optimal solution, which is a strong spanning tree constructed, according to a well-cho
Externí odkaz:
https://doaj.org/article/fffe1917457847329f1c1e64dd6e940e
Autor:
Belkacem Salima Nait
Publikováno v:
Foundations of Computing and Decision Sciences, Vol 46, Iss 1, Pp 11-26 (2021)
In this paper, we propose an algorithm which is based on many things: the notions well-known of the simplex network method, Ford Fulkerson’s algorithm and our new idea, which is << the gain cycles >>, applied on a bi-objective minimum cost flow pro
Externí odkaz:
https://doaj.org/article/4d7c2facc898410cbb9167e225a48e54
Autor:
Hyeonjoong Cho, Arvind Easwaran
Publikováno v:
IEEE Access, Vol 8, Pp 172136-172151 (2020)
We consider the flow network model to solve the multiprocessor real-time task scheduling problems. Using the flow network model or its generic form, linear programming (LP) formulation, for the problems is not new. However, the previous works have li
Externí odkaz:
https://doaj.org/article/3bf50be579ce49bc919ffca94fd692c6
Publikováno v:
IEEE Access, Vol 7, Pp 44645-44658 (2019)
Applications related to the Internet of Things are widely diversified and require both low latency and the access of massive sensors to wireless sensor networks. In physical wireless parameter conversion sensor networks (PhyC-SN), a fusion center (FC
Externí odkaz:
https://doaj.org/article/747f190172bf4900bd2657cf18d926ad
Publikováno v:
Management Science, 1999 Oct 01. 45(10), 1440-1455.
Externí odkaz:
https://www.jstor.org/stable/2634849
Publikováno v:
Operations Research, 1999 Mar 01. 47(2), 291-298.
Externí odkaz:
https://www.jstor.org/stable/223046
Publikováno v:
Future Generation Computer Systems. 127:396-408
Service function chains, or more generally, virtual network services, evolve throughout their life-cycle due to traffic fluctuations, resource usage, and the stringent requirements of the SLO (Service Level Objective) that must be fulfilled. Network
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e31a53f594ef69b06162dfd89e9d4617
https://doi.org/10.1016/j.future.2021.09.017
https://doi.org/10.1016/j.future.2021.09.017
Publikováno v:
Journal of Combinatorial Optimization. 44:242-268
In this paper, an extension of the minimum cost flow problem is considered in which multiple incommensurate weights are associated with each arc. In the minimum cost flow problem, flow is sent over the arcs of a graph from source nodes to sink nodes.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8fb71c81c92a57d4fba7722df20ef3f5
https://doi.org/10.1007/s10878-021-00823-0
https://doi.org/10.1007/s10878-021-00823-0
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
https://doi.org/10.1080/02331934.2021.1995730
Publikováno v:
Operations Research. 69:1256-1281
When allocating scarce resources such as organs or public housing units, the policy maker needs to carefully balance two conflicting objectives: maximizing the reward from matching and minimizing inequity across different types of candidates. We cons
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b5ea84c807263971b023785ed4f7c1d4
https://doi.org/10.1287/opre.2020.2015
https://doi.org/10.1287/opre.2020.2015