Results 31 to 40 of about 335 (76)
Algorithms for minimum flows [PDF]
Computer Science Journal of Moldova, 2001 We present a generic preflow algorithm and several implementations of it, that solve the minimum flow problem in O(n2m) time.
Eleonor Ciurea, Laura Ciupal
doaj
Sink location to find optimal shelters in evacuation planning
EURO Journal on Computational Optimization, 2016 The sink location problem is a combination of network flow and location problems: from a given set of nodes in a flow network a minimum cost subset W has to be selected such that given supplies can be transported to the nodes in W.
P. Heßler, H.W. Hamacher
doaj +1 more source
Why Optimal States Recruit Fewer Reactions in Metabolic Networks [PDF]
, 2012 The metabolic network of a living cell involves several hundreds or thousands of interconnected biochemical reactions. Previous research has shown that under realistic conditions only a fraction of these reactions is concurrently active in any given cell.
Lee, Joo Sang +2 more
core +1 more source
EURO Journal on Computational Optimization, 2017 One challenge for social network researchers is to evaluate balance in a social network. The degree of balance in a social group can be used as a tool to study whether and how this group evolves to a possible balanced state.
Mario Levorato +3 more
doaj +1 more source
The maximum flow in dynamic networks [PDF]
Computer Science Journal of Moldova, 2005 The dynamic maximum flow problem that generalizes the static maximum flow problem is formulated and studied. We consider the problem on a network with capacities depending on time, fixed transit times on the arcs, and a given time horizon.
Maria A. Fonoberova, Dmitrii D. Lozovanu
doaj
A branch-and-cut algorithm for the target visitation problem
EURO Journal on Computational Optimization, 2019 In this paper, we consider the target visitation problem (TVP) which arises in the context of disaster treatment. Mathematically speaking, the problem is concerned with finding a route to visit a set of targets starting from and returning to some base ...
Achim Hildenbrandt
doaj +1 more source
On some interconnections between combinatorial optimization and extremal graph theory [PDF]
, 2004 The uniting feature of combinatorial optimization and extremal graph theory is that in both areas one should find extrema of a function defined in most cases on a finite set.
Cvetković Dragoš M. +2 more
core +1 more source
Complementarity-based nonlinear programming techniques for optimal mixing in gas networks
EURO Journal on Computational Optimization, 2019 We consider nonlinear and nonsmooth mixing aspects in gas transport optimization problems. As mixed-integer reformulations of pooling-type mixing models already render small-size instances computationally intractable, we investigate the applicability of ...
FalkM. Hante, Martin Schmidt
doaj +1 more source
EURO Journal on Computational Optimization, 2015 Many real-world optimization models comprise nonconvex and nonsmooth functions leading to very hard classes of optimization models. In this article, a new interior-point method for the special, but practically relevant class of optimization problems with
Martin Schmidt
doaj +1 more source
Sum-of-squares clustering on networks [PDF]
, 2011 Finding p prototypes by minimizing the sum of the squared distances from a set of points to its closest prototype is a well-studied problem in clustering, data analysis and continuous location. In this note, this very same problem is addressed assuming,
Carrizosa Priego, Emilio José +2 more
core +2 more sources