Hard cases of the multifacility location problem [PDF]
, 2004 Let μ be a rational-valued metric on a finite set T. We consider (a version of) the multifacility location problem: given a finite set V⊇T and a function c:V2→Z+, attach each element x∈V−T to an element γ(x)∈T minimizing ∑c(xy)μ(γ(x)γ(y)):xy∈V2, letting ...
Karzanov, Alexander V.
core +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
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
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
Monotone properties of random geometric graphs have sharp thresholds
, 2005 Random geometric graphs result from taking $n$ uniformly distributed points in the unit cube, $[0,1]^d$, and connecting two points if their Euclidean distance is at most $r$, for some prescribed $r$.
Goel, Ashish +2 more
core +3 more sources
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 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
An efficient algorithm for critical circuits and finite eigenvectors in the max-plus algebra [PDF]
, 1999 We consider the eigenvalue problem in the max-plus algebra for matrices in {−∞∪R}n×n but with eigenvectors in Rn. The problem is relaxed to a linear optimization (LO) problem of which the dual problem is solved by finding a maximal average weight circuit
Olsder, Geert-Jan +2 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
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