Results 11 to 20 of about 213,568 (263)
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
Smoothed Analysis of the Minimum-Mean Cycle Canceling Algorithm and the Network Simplex Algorithm
Journal of Graph Algorithms and Applications, 2020 The minimum-cost flow (MCF) problem is a fundamental optimization problem with many applications and seems to be well understood. Over the last half century many algorithms have been developed to solve the MCF problem, and these algorithms have varying ...
Kamiel Cornelissen, Bodo Manthey
doaj +1 more source
A dual exterior point simplex type algorithm for the minimum cost network flow problem [PDF]
Yugoslav Journal of Operations Research, 2009 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
, 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
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
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
Smoothed Analysis of Belief Propagation for Minimum-Cost Flow and Matching
Journal of Graph Algorithms and Applications, 2013 Belief propagation (BP) is a message-passing heuristic for statistical inference in graphical models such as Bayesian networks and Markov random fields.
Tobias Brunsch +3 more
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
Journal of Applied Sciences and Environmental Management, 2018 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
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