Results 21 to 30 of about 356,172 (299)
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
In an urban transport system, a dysfunction often occurred as demand for transportation infrastructure exceeds available supply. The result includes traffic congestion, higher travel time and cost, higher emission of harmful gases and general reduction ...
JO Olusina, OU Nse
doaj +1 more source
A note on efficient minimum cost adjustment sets in causal graphical models
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 Almost-Linear Time
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
Minimum cost network flows: Problems, algorithms, and software [PDF]
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
Faster Sparse Minimum Cost Flow by Electrical Flow Localization [PDF]
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
Mean-Standard Deviation Model for Minimum Cost Flow Problem
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
Maximum flow and minimum-cost flow in multi-interface networks [PDF]
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
Traffic flow consideration in design of freight distribution system
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
Multibaseline Gradient Ambiguity Resolution To Support Minimum Cost Flow Phase Unwrapping
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

