Results 11 to 20 of about 88,447 (299)
Minimum cost noncrossing flow problem on layered networks [PDF]
Discrete Applied Mathematics, 2019 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
I. Kuban Altinel +3 more
openaire +4 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 +2 more sources
Flow Network Models for Online Scheduling Real-Time Tasks on Multiprocessors
IEEE Access, 2020 We consider the flow network model to solve the multiprocessor real-time task scheduling problems. Using the flow network model or its generic form, linear programming (LP) formulation, for the problems is not new.
Hyeonjoong Cho, Arvind Easwaran
doaj +1 more source
A survey on exact algorithms for the maximum flow and minimum‐cost flow problems [PDF]
Networks, 2023 AbstractNetwork flow problems form an important and much‐studied family of combinatorial optimization problems, with a huge array of practical applications. Two network flow problems in particular have received a great deal of attention: the maximum flow and minimum‐cost flow problems.
Oliverio Cruz-Mejia, Adam N. Letchford
openaire +1 more source
Multiple objective minimum cost flow problems: A review [PDF]
European Journal of Operational Research, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hamacher, Horst W. +2 more
openaire +3 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
Solving Robust Variants of Integer Flow Problems with Uncertain Arc Capacities
Promet (Zagreb), 2021 This paper deals with robust optimization and network flows. Several robust variants of integer flow problems are considered. They assume uncertainty of network arc capacities as well as of arc unit costs (where applicable).
Marko Špoljarec, Robert Manger
doaj +1 more source
Multibaseline Gradient Ambiguity Resolution To Support Minimum Cost Flow Phase Unwrapping [PDF]
, 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
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
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