Results 21 to 30 of about 321 (78)
EURO Journal on Computational Optimization, 2016 This paper addresses two variants of the routing and wavelength assignment problem arising in the context of optical transport networks. In both variants, we address the case where the physical coverage of the fiber network is such that regenerators, to ...
Amaro de Sousa +2 more
doaj +1 more source
Road network emergency accessibility planning after a major earthquake
EURO Journal on Computational Optimization, 2016 In the aftermath of disasters such as major earthquakes, several roads may be blocked by rubble and the population tends to search refugee in certain gathering points of the city.
CelsoSatoshi Sakuraba +5 more
doaj +1 more source
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
Polynomial Time Algorithm for Determining Max-Min Paths in Networks and Solving Zero Value Cyclic Games [PDF]
Computer Science Journal of Moldova, 2005 We study the max-min paths problem, which represents a game version of the shortest and the longest paths problem in a weighted directed graph. In this problem the vertex set V of the weighted directed graph G=(V,E) is divided into two disjoint subsets ...
Dmitrii D. Lozovanu
doaj
An approximation algorithm for the generalized minimum spanning tree problem with bounded cluster size [PDF]
, 2001 Given a complete undirected graph with the nodes partitioned into m node sets called clusters, the Generalized Minimum Spanning Tree problem denoted by GMST is to find a minimum-cost tree which includes exactly one node from each cluster.
Kern, W., Pop, P.C., Still, G.J.
core +1 more source
An ISS Small-Gain Theorem for General Networks
, 2005 We provide a generalized version of the nonlinear small-gain theorem for the case of more than two coupled input-to-state stable (ISS) systems. For this result the interconnection gains are described in a nonlinear gain matrix and the small-gain ...
A Berman +24 more
core +5 more sources
The generalized minimum spanning tree polytope and related polytopes [PDF]
, 2001 The Generalized Minimum Spanning Tree problem denoted by GMST is a variant of the classical Minimum Spanning Tree problem in which nodes are partitioned into clusters and the problem calls for a minimum cost tree spanning at least one node from each ...
Pop, P.C.
core +1 more source
A note on polylinking flow networks [PDF]
, 2013 This is a supplementary note on M. X. Goemans, S. Iwata, and R. Zenklusen’s paper that proposes a flow model based on polylinking systems. Their flow model is a series (or tandem) connection of polylinking systems.
Fujishige, Satoru
core +1 more source
Characterization of reward functions in networks with costs [PDF]
, 2010 In this paper we study network structures in which the possibilities for cooperation are restricted and can not be described by a cooperative game. The benefits of a group of players depend on how these players are internally connected.
Ferreras García, Raquel +1 more
core +1 more source
A Parametric Network Approach for Concepts Hierarchy Generation in Text Corpus
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2016 The article presents a preflow approach for the parametric maximum flow problem, derived from the rules of constructing concepts hierarchy in text corpus.
Sângeorzan L. S. +2 more
doaj +1 more source