Additional Information
| Author(s) | Horvat-Marc, Andrei, Pop Sitar, Corina, Pop, Petrică Claudiu |
|---|
At least version of the generalized minimum spanning tree problem
Petrică C. Pop ♦ Andrei Horvat Marc ♦ Corina Pop Sitar
Abstract
carpathian_2006_22_129_135_abstractFull PDF
carpathian_2006_22_129_135We consider the at least version of the Generalized Minimum Spanning Tree Problem, denoted by L-GMST, which consists in finding a minimum cost tree spanning at least one node from each node set of a complete graph with the nodes partitioned into a given number of node sets. We describe new integer programming formulations of the L-GMST problem and establish relationships between the polytopes corresponding to their linear relaxations.
Recently posted
-
Stability of new functional equations and partial multipliers in Banach *-algebras
-
Characterizations of amenable gyrogroups related to Tarski's Theorem
-
Two new extragradient methods for solving pseudomonotone the equilibrium problem in Hilbert spaces
-
On the error estimates for the sequence of successive approximations for cyclic \varphi–contractions in metric spaces
-
Hybrid CG-Like Algorithm for Nonlinear Equations and Image Restoration
-
New class of n-order fractional differential equations and solvability in the double sequence space m^2(\Delta_{v}^{u}, \phi,p)
-
Constructing DNA Codes using Double Cyclic Codes of Odd and Even Lengths over F2 + u F2
-
Consequences of the product rule in Stieltjes differentiability
-
On the existence and uniqueness of fixed points in Banach spaces using the Krasnoselskij iterative method
-
A quaternionic product of simple ratios