Results 11 to 20 of about 218,505 (300)
Coupled Minimum-Cost Flow Cell Tracking
A growing number of screening applications require the automated monitoring of cell populations in a high-throughput, high-content environment. These applications depend on accurate cell tracking of individual cells that display various behaviors including mitosis, occlusion, rapid movement, and entering and leaving the field of view.
Dirk Ryan Padfield +2 more
openaire +4 more sources
The Minimum Universal Cost Flow in an Infeasible Flow Network [PDF]
In this paper the concept of the Minimum Universal Cost Flow (MUCF) for an infeasible flow network is introduced. A new mathematical model in which the objective function includes the total costs of changing arc capacities and sending flow is built and ...
doaj +1 more source
The minimum cost multicommodity flow problem in dynamic networks and an algorithm for its solving [PDF]
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 +1 more source
A decentralized solution for the constrained minimum cost flow
In this paper we propose a decentralized solution to the problem of network stabilization, under flow constraints ensuring steady—state flow optimality. We propose a stabilizing strategy for network flow control with capacity constraints which drives the buffer levels arbitrarily close to a desired reference. This is a decentralized strategy optimizing
Dario Bauso +3 more
openaire +5 more sources
A method for the solution of the homogeneous inventory-production optimisation problem
The subject of this paper is the inventory-production problem, which is a one of the optimization problems in a decision area in which inventory volume and production volume are considered together.
Schiff Krzysztof
doaj +1 more source
A dual exterior point simplex type algorithm for the minimum cost network flow problem [PDF]
A new dual simplex type algorithm for the Minimum Cost Network Flow Problem (MCNFP) is presented. The proposed algorithm belongs to a special 'exterior- point simplex type' category.
Geranis George +2 more
doaj +1 more source
Minimum Cost Flow in the CONGEST Model
We consider the CONGEST model on a network with $n$ nodes, $m$ edges, diameter $D$, and integer costs and capacities bounded by $\text{poly} n$. In this paper, we show how to find an exact solution to the minimum cost flow problem in $n^{1/2+o(1)}(\sqrt{n}+D)$ rounds, improving the state of the art algorithm with running time $m^{3/7+o(1)}(\sqrt nD^{1 ...
openaire +2 more sources
Solving transportation problems with concave cost functions using genetic algorithms [PDF]
In this paper we propose a genetic algorithm for solving the non-linear transportation problem on a network with concave cost functions and the restriction that the flow must pass through all arcs of the network. We show that the algorithm can be used in
Tatiana Pasa
doaj
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
Scheduling of Multiple Autonomous Guided Vehicles for an Assembly Line Using Minimum Cost Network Flow [PDF]
This paper proposed a parallel automated assembly line system to produce multiple products having multiple autonomous guided vehicles (AGVs). Several assembly lines are configured to produce multiple products in which the technologies of machines are ...
Hamed Fazlollahtabar
doaj +1 more source

