Results 21 to 30 of about 790 (89)
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
Block-diagonal semidefinite programming hierarchies for 0/1 programming [PDF]
, 2007 Lovasz and Schrijver, and later Lasserre, proposed hierarchies of semidefinite programming relaxations for general 0/1 linear programming problems. In this paper these two constructions are revisited and two new, block-diagonal hierarchies are proposed ...
Balas +18 more
core +4 more sources
On stability of Nash equilibrium situations and Pareto optimal situations in finite games [PDF]
Computer Science Journal of Moldova, 2003 A non-cooperative finite game of several persons is considered in the case, where payoff functions are linear. Extreme levels of independent perturbations of payoff functions parameters, which remain Nash and Pareto optimality of a situation, are ...
Vladimir A. Emelichev +1 more
doaj
A greedy algorithm for interval greedoids
Open Mathematics, 2018 We show that the greedy algorithm provided in this paper works for interval greedoids with positive weights under some conditions, and also characterize an exchangeable system to be an interval greedoid with the assistance of the greedy algorithm.
Mao Hua
doaj +1 more source
Discrete Particle Swarm Optimization for the minimum labelling Steiner tree problem [PDF]
, 2008 Particle Swarm Optimization is an evolutionary method inspired by the social behaviour of individuals inside swarms in nature. Solutions of the problem are modelled as members of the swarm which fly in the solution space.
AS Tanenbaum +19 more
core +2 more sources
Postoptimal analysis of one lexicographic combinatorial problem with non-linear criteria [PDF]
Computer Science Journal of Moldova, 2009 In this article we consider a multicriteria combinatorial problem with ordered MINMIN criteria. We obtain necessary and sufficient conditions of that type of stability to the initial data perturbations for which all lexicographic optima of the original ...
Vladimir A. Emelichev, Olga V. Karelkina
doaj
Cyclic flats and corners of the linking polynomial
Acta Universitatis Sapientiae: Mathematica, 2018 Let T(M; x,y) = ∑ij Tij xiyjdenote the Tutte polynomial of the matroid M. If Tij is a corner of T (M; x, y), then Tij counts the sets of corank i and nullity j and each such set is a cyclic flat of M. The main result of this article consists of extending
Kayibi Koko K., Samee U., Pirzada S.
doaj +1 more source
Matching ontologies with kernel principle component analysis and evolutionary algorithm
Demonstratio MathematicaOntology serves as a structured knowledge representation that models domain-specific concepts, properties, and relationships. Ontology matching (OM) aims to identify similar entities across distinct ontologies, which is essential for enabling ...
Xue Xingsi, Ye Miao, Nian Qifeng
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
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