Results 11 to 20 of about 321 (78)
Evaluating the quality of image matrices in blockmodeling
EURO Journal on Computational Optimization, 2015 One approach for analyzing large networks is to partition its nodes into classes where the nodes in a class have similar characteristics with respect to their connections in the network. A class is represented as a blockmodel (or image matrix).
Stefan Wiesberg, Gerhard Reinelt
doaj +1 more source
Game-Theoretic Approach for Solving Multiobjective Flow Problems on Networks [PDF]
Computer Science Journal of Moldova, 2005 The game-theoretic formulation of the multiobjective multicommodity flow problem is considered. The dynamic version of this problem is studied and an algorithm for its solving, based on the concept of multiobjective games, is proposed.
Maria A. Fonoberova, Dmitrii D. Lozovanu
doaj
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
Switch 2.0: A modern platform for planning high-renewable power systems
SoftwareX, 2019 Switch 2.0 is an open-source platform for planning transitions to low-emission electric power systems, designed to satisfy 21st century grid planning requirements.
Josiah Johnston +3 more
doaj +1 more source
Optimal Control of Sweeping Processes in Robotics and Traffic Flow Models [PDF]
, 2018 The paper is mostly devoted to applications of a novel optimal control theory for perturbed sweeping/Moreau processes to two practical dynamical models.
Colombo, Giovanni +2 more
core +2 more sources
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
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
Matheuristics for optimizing the network in German wagonload traffic
EURO Journal on Computational Optimization, 2017 In this paper, we consider a capacitated multiple allocation hub location problem derived from a practical application in network design of German wagonload traffic.
Julia Sender +3 more
doaj +1 more source
Evaluating performance of image segmentation criteria and techniques
EURO Journal on Computational Optimization, 2013 The image segmentation problem is to delineate, or segment, a salient feature in an image. As such, this is a bipartition problem with the goal of separating the foreground from the background. An NP-hard optimization problem, the Normalized Cut problem,
DoritS. Hochbaum +2 more
doaj +1 more source
Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design
EURO Journal on Computational Optimization, 2014 We present a branch-and-price-and-cut algorithm for solving large-scale instances of the multicommodity capacitated fixed-charge network design problem.
Bernard Gendron, Mathieu Larose
doaj +1 more source