This paper describes a biased random-key genetic algorithm for a real-world wireless
backhaul network design problem. This is a novel problem, closely related to variants of the …

We consider a network design problem that generalizes the hop and diameter constrained
Steiner tree problem as follows: Given an edge-weighted undirected graph with two disjoint …

This paper investigates two approaches for solving bi-objective constrained minimum
spanning tree problems. The first seeks to minimize the tree weight, keeping the problem's …

This paper studies the generalized hop-constrained minimum spanning tree problem
(GHMSTP) which has applications in backbone network design subject to quality-of-service …

We consider a rather generic class of network design problems in which a set or subset of
given terminal nodes must be connected to a dedicated root node by simple paths and a …

In this work we address the Hop-Constrained Minimum cost Flow Spanning Tree (HMFST)
problem with nonlinear costs. The HMFST problem is an extension of the Hop-Constrained …

The environmental concerns are having a significant impact on the operation of power
systems. The traditional Unit Commitment problem, which to minimizes the fuel cost is …

The k-cardinality degree constrained clustered minimum spanning tree problem (k-
DCCMST) aims to determine a k-node (out of n nodes) spanning tree of minimum weight …

Hop constraints are used to limit the number of links between two given points in a network,
this way improving the quality of service by increasing the availability and reliability of the …

The hop-constrained Steiner tree problem (HSTP) is a generalization of the classical Steiner
tree problem. It asks for a minimum cost subtree that spans some specified nodes of a given …