Additional information
| Author(s) | Horvat-Marc, Andrei, Pop Sitar, Corina, Pop, Petrică Claudiu |
|---|
At least version of the generalized minimum spanning tree problem
We 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.
Related products
Recently posted
-
Approximate Solutions for Multi-Objective Optimization Problems via Scalarizing and Nonscalarizing Methods
-
A product of strongly quasi-nonexpansive mappings in Hadamard spaces
-
Inertial viscosity fixed point algorithms for monotone inclusion, convex minimization, and image restoration problems
-
Holderian Stability for Parametric Optimization Models and Applications
-
A Novel Fixed-Point Based Two-Step Inertial Algorithm for Convex Bilevel Optimization in Deep Learning Data Classification
-
Double-step inertial algorithms for equilibrium and fixed point problems in Hilbert spaces
-
Accelerated forward-backward algorithm based on inertial and correction terms with linesearch for solving convex minimization problem and its application
-
A Dual-Projective Double Inertial Forward-Backward Splitting Algorithm for Variational Inclusion Problems with Applications to External Validation in Breast Cancer Diagnosis
-
Efficient Large-Scale Classification with Linex Least Square Twin Bounded Support Vector Machine
-
Classifying compressive strength of clay bricks using an inertial projected forward-backward algorithm