Results 21 to 30 of about 218,505 (300)
Mean-Standard Deviation Model for Minimum Cost Flow Problem
, 2022 We study the mean-standard deviation minimum cost flow (MSDMCF) problem, where the objective is minimizing a linear combination of the mean and standard deviation of flow costs. Due to the nonlinearity and nonseparability of the objective, the problem is
Stephen D. Boyles +5 more
core +1 more source
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
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
Energies, 2021 The aim of this paper is to present a model of energy efficient scheduling for series production systems during operation, including setup and shutdown activities.
Adrian Kampa, Iwona Paprocka
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
Maximum Flow and Minimum-Cost Flow in Almost-Linear Time
2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS), 2022 We present an algorithm that computes exact maximum flows and minimum-cost flows on directed graphs with m edges and polynomially bounded integral demands, costs, and capacities in \(m^{1+o(1)}\) time. Our algorithm builds the flow through a sequence of
Li Chen 0028 +5 more
openaire +5 more sources
Multibaseline Gradient Ambiguity Resolution To Support Minimum Cost Flow Phase Unwrapping
, 2010 The TanDEM-X Mission has as primary objective to generate a high resolution global Digital Elevation Model. This paper proposes a new method for multibaseline Phase Unwrapping which is the critical point of this generation.
Marie Lachaise +5 more
core +1 more source
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
Fuzzy multi-level minimum cost flow problems
, 2011 Both multiple objectives and multiple hierarchies minimum cost flow problems with fuzzy costs and fuzzy capacities in the arcs are investigated. To reduce the complexity, a possibility programming is used to handle the vagueness in the parameters.
Shih, H.-S.; Lee, ES
core +1 more source