For the past few decades, combinatorial optimization techniques have been shown to be
powerful tools for formulating and solving optimization problems arising from practical …

Given a graph with nonnegative edge weights and node pairs Q, we study the problem of
constructing a minimum weight set of edges so that the induced subgraph contains at least K …

The hop-constrained minimum spanning tree problem (HMSTP) is an NP-hard problem
arising in the design of centralized telecommunication networks with quality of service …

This article studies the scheduling of critical embedded systems, which consist of a set of
communicating periodic tasks with constrained deadlines. Currently, tasks are usually …

We address the tactical planning problem faced by container liner ship** companies to
select a set of sailing services from a given pool of candidate services and route available …

In the area of evolutionary computation the calculation of diverse sets of high-quality
solutions to a given optimization problem has gained momentum in recent years under the …

Chan, Har-Peled, and Jones [SICOMP 2020] developed locality-sensitive orderings (LSO)
for Euclidean space. A $(\tau,\rho) $-LSO is a collection $\Sigma $ of orderings such that for …

In this chapter we present a general framework for modeling the hopconstrained minimum
spanning tree problem (HMST) which includes formulations already presented in the …

A system is antifragile if its performance improves as the result of exposure to stressors,
shocks, or disruptions. This behavior is typical of complex systems and is not usually …

In network design problems, such as compact routing, the goal is to route packets between
nodes using the (approximated) shortest paths. A desirable property of these routes is a …