Results 11 to 20 of about 356,172 (299)
Coupled Minimum-Cost Flow Cell Tracking
, 2009 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]
Journal of Sciences, Islamic Republic of Iran, 2006 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
A Faster Strongly Polynomial Minimum Cost Flow Algorithm [PDF]
Operations Research, 1988 In this paper, we present a new strongly polynomial time algorithm for the minimum cost flow problem, based on a refinement of the Edmonds-Karp scaling technique. Our algorithm solves the uncapacitated minimum cost flow problem as a sequence of O(n log n) shortest path problems on networks with n nodes and m arcs and runs in O(n log n(m + n log n ...
James B. Orlin, James Orlin
openaire +5 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 +1 more source
A decentralized solution for the constrained minimum cost flow
49th IEEE Conference on Decision and Control (CDC), 2010 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
Minimum cost noncrossing flow problem on layered networks
Discrete Applied Mathematics, 2019 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
I. Kuban Altinel +3 more
openaire +4 more sources
Capacity inverse minimum cost flow problem [PDF]
Journal of Combinatorial Optimization, 2008 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Güler, Cigdem, Hamacher, Horst
openaire +2 more sources
A method for the solution of the homogeneous inventory-production optimisation problem
Technical Transactions, 2020 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
Scheduling of Multiple Autonomous Guided Vehicles for an Assembly Line Using Minimum Cost Network Flow [PDF]
Journal of Optimization in Industrial Engineering, 2018 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
Minimum Cost Flow in the CONGEST Model
, 2023 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