
MixedInteger Approaches to Constrained Optimum Communication Spanning Tree Problem
Several novel mixedinteger linear and bilinear formulations are propose...
read it

Extended formulation and valid inequalities for the multiitem inventory lotsizing problem with supplier selection
This paper considers the multiitem inventory lotsizing problem with su...
read it

On the hopconstrained Steiner tree problems
The hopconstrained Steiner tree problem is a generalization of the clas...
read it

Improved Formulations and Branchandcut Algorithms for the Angular Constrained Minimum Spanning Tree Problem
The Angular Constrained Minimum Spanning Tree Problem (αMSTP) is define...
read it

A Social DistancingBased Facility Location Approach for Combating COVID19
In this paper, we introduce and study the problem of facility location a...
read it

Developing Approaches for Solving a Telecommunications Feature Subscription Problem
Call control features (e.g., calldivert, voicemail) are primitive opti...
read it

On the minimum quartet tree cost problem
Given a set of n data objects and their pairwise dissimilarities, the go...
read it
Upgrading nodes in treeshaped hub location
In this paper, we introduce the Tree of Hubs Location Problem with Upgrading, a mixture of the Tree of Hubs Location Problem, presented by Contreras et. al (2010), and the Minimum Cost Spanning Tree Problem with Upgraded nodes, studied for the first time by Krumke (1999). In addition to locate the hubs, to determine the tree that connects the hubs and to allocate nonhub nodes to hubs, a decision has to be made about which of the hubs will be upgraded, taking into account that the total number of upgraded nodes is given. We present two different Mixed Integer Linear Programming formulations for the problem, tighten the formulations and generate several families of valid inequalities for them. A computational study is presented showing the improvements attained with the strengthening of the formulations and comparing them.
READ FULL TEXT
Comments
There are no comments yet.