Results 251 to 260 of about 87,677 (298)
Fuzzy multi-level minimum cost flow problems
Fuzzy Sets and Systems, 1999 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hsu-Shih Shih, E. Stanley Lee
openaire +3 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Uncertain minimum cost multicommodity flow problem
Soft Computing, 2015zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sibo Ding
exaly +2 more sources
Combinatorial algorithms for the minimum interval cost flow problem
Applied Mathematics and Computation, 2006zbMATH Open Web Interface contents unavailable due to conflicting licenses.
S Mehdi Hashemi +2 more
exaly +2 more sources
On the minimum cost multiple-source unsplittable flow problem
RAIRO - Operations Research, 2007 Summary: The minimum cost multiple-source unsplittable flow problem is studied in this paper. A simple necessary condition to get a solution is proposed. It deals with capacities and demands and can be seen as a generalization of the well-known semi-metric condition for continuous multicommdity flows.
Meriema Belaidouni, Walid Ben-Ameur
openaire +2 more sources
A minimum cost network flow model for the maximum covering and patrol routing problem
European Journal of Operational Research, 2015 This paper shows how the maximum covering and patrol routing problem (MCPRP) can be modeled as a minimum cost network flow problem (MCNFP). Based on the MCNFP model, all available benchmark instances of the MCPRP can be solved to optimality in less than ...
Raf Dewil, Pieter Vansteenwegen
exaly +2 more sources
Minimum‐cost flow problems having arc‐activation costs
Naval Research Logistics (NRL), 2021AbstractTime‐dependent network applications, such as wireless sensor network and infrastructure optimization settings, may require dynamic flows to be transmitted according to a nonsimultaneous schedule of path‐flows. We study a dynamic network flow optimization problem considering the presence of activation costs required to begin transmitting flow on
Robert M. Curry, J. Cole Smith
openaire +2 more sources
Time-varying minimum cost flow problems
European Journal of Operational Research, 2001zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xiaoqiang Cai, Dan Sha, C. K. Wong
openaire +2 more sources
Minimum Cost Source Location Problems with Flow Requirements
Algorithmica, 2006zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mariko Sakashita +2 more
openaire +1 more source
Minimum convex cost flow problem
Fourth International Conference on Information, Communications and Signal Processing, 2003 and the Fourth Pacific Rim Conference on Multimedia. Proceedings of the 2003 Joint, 2004Minimum cost flow (MCF) problem is a typical example of network flow problems, for which an additional constraint of cost is added to each flow. Conventional MCF problems consider the cost constraints that are linear functions of flow. In this paper, we extend the MCF problem to cover cost functions that are strictly convex and differentiable, and ...
null Viet Anh Nguyen, null Yap-Peng Tan
openaire +1 more source
Solving the undirected minimum cost flow problem with arbitrary costs
Networks, 2004AbstractWe address the undirected minimum cost flow problem with arbitrary arcs costs. Any optimal solution for this problem is characterized by the property that the flow of each arc with negative cost must be equal to its capacity. That is, the flow can be nonzero in both directions.
Antonio Sedeño-Noda +2 more
openaire +2 more sources