Results 21 to 30 of about 213,568 (263)
Faster Sparse Minimum Cost Flow by Electrical Flow Localization [PDF]
2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS), 2022 We give an $\widetilde{O}({m^{3/2 - 1/762} \log (U+W))}$ time algorithm for minimum cost flow with capacities bounded by $U$ and costs bounded by $W$. For sparse graphs with general capacities, this is the first algorithm to improve over the $\widetilde{O}({m^{3/2} \log^{O(1)} (U+W)})$ running time obtained by an appropriate instantiation of an ...
Axiotis, Kyriakos +2 more
openaire +3 more sources
A note on efficient minimum cost adjustment sets in causal graphical models
Journal of Causal Inference, 2022 We study the selection of adjustment sets for estimating the interventional mean under an individualized treatment rule. We assume a non-parametric causal graphical model with, possibly, hidden variables and at least one adjustment set composed of ...
Smucler Ezequiel, Rotnitzky Andrea
doaj +1 more source
Maximum flow and minimum-cost flow in multi-interface networks [PDF]
Proceedings of the 5th International Conference on Ubiquitous Information Management and Communication, 2011 In heterogeneous networks, devices can communicate by means of multiple wired or wireless interfaces. By switching among interfaces or by combining the available interfaces, each device might establish several connections. A connection is established when the devices at its endpoints share at least one active interface.
Gianlorenzo D'Angelo +2 more
openaire +4 more sources
Minimum cost network flows: Problems, algorithms, and software [PDF]
Yugoslav Journal of Operations Research, 2013 We present a wide range of problems concerning minimum cost network flows, and give an overview of the classic linear single-commodity Minimum Cost Network Flow Problem (MCNFP) and some other closely related problems, either tractable or intractable ...
Sifaleras Angelo
doaj +1 more source
Finding minimum-cost flows by double scaling [PDF]
Mathematical Programming, 1992 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ravindra K. Ahuja +3 more
openaire +2 more sources
The minimum cost multicommodity flow problem in dynamic networks and an algorithm for its solving [PDF]
Computer Science Journal of Moldova, 2005 The dynamic version of the minimum cost multicommodity flow problem that generalizes the static minimum cost multicommodity flow problem is formulated and studied.
Maria A. Fonoberova, Dmitrii D. Lozovanu
doaj
Traffic flow consideration in design of freight distribution system
IATSS Research, 2010 This study is part of a series of research projects on a distribution system we developed to deal with cases in a state-owned company. It concerns the design of the Public Service Obligation State-owned Company (PSO-SOC) distribution system.
Sutanto Soehodho, Nahry
doaj +1 more source
Minimum Cost Flow Model and Algorithm of Virtual Network Embedding
Dianxin kexue, 2014 The dynamic process of network virtualization was studied,and the inversion phenomenon that the revenue did not rely on embedding cost was discovered.Then minimum cost flow model and algorithms of virtual network embedding which fit for creating virtual ...
Xiaohua Chen +3 more
doaj +2 more sources
Flow Network Models for Online Scheduling Real-Time Tasks on Multiprocessors
IEEE Access, 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.
Hyeonjoong Cho, Arvind Easwaran
doaj +1 more source
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background An earlier study on children diagnosed with acute lymphoblastic leukemia (ALL) at Moi Teaching and Referral Hospital (MTRH) in Kenya reported a low event‐free survival (EFS), excess treatment abandonment, and high induction mortality.
Gilbert Olbara +7 more
wiley +1 more source