This article addresses the minimum spanning tree problem with conflicting edge pairs, a
variant of the classical minimum spanning tree where, given a list of conflicting edges, the …

We provide an introduction to Lagrangian relaxation, a methodology which consists in
moving into the objective function, by means of appropriate multipliers, certain complicating …

Given a graph with a weight associated with each vertex, the maximum weighted induced
forest problem (MWIF) consists of encountering a maximum weighted subset of the vertices …

This paper addresses a variant of the minimum spanning tree problem in which, given a list
of conflicting edges, the primary goal is to find a spanning tree with the minimum number of …

Features of statistical and operational research methods and tools being used to improve
the healthcare industry With a focus on cutting-edge approaches to the quickly growing field …

In this paper we take into account three different spanning tree problems with degree-
dependent objective functions. The main application of these problems is in the field of …

Given a weighted graph G=(V, E), the minimum weighted feedback vertex set problem
consists in obtaining a minimum weight subset F⊆ V of the vertex set whose removal makes …

We address the problem of synchronizing the loading and discharging operations of trucks
at a particular cross-docking center, with one door at both the inbound and outbound sides …

Given a connected undirected graph G=(V, E), the Minimum Branch Vertices Problem
(MBVP) asks for a spanning tree of G with the minimum number of vertices having degree …

Abstract The Minimum Number of Branch Vertices Spanning Tree Problem is to minimize the
number of vertices of degree greater than two in a spanning tree. We present a branch-and …