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 …

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

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

When unmanned aerial vehicles (UAVs) are used for surveillance, information must often be
transmitted to a base station in real time. However, limited communication ranges and the …

The refugee crisis is one of the major challenges of modern society. The influxes of refugees
are usually sudden and the refugees are in sheer need of services such as health care …

Long-term planning for transportation, telecommunications, and other service operations
entails designing networks that are both cost effective and responsive. Because …

This article deals with the Two‐edge connected Hop‐constrained Network Design Problem
(or THNDP for short). Given a weighted graph G=(N, E), an integer L≥ 2, and a subset of …

Abstract We study the Minimum Length-Bounded Cut problem where the task is to find a set
of edges of a graph such that after removal of this set, the shortest path between two …

In this paper we study Integer Linear Programming models and develop branch-and-cut
algorithms to solve the Black-and-White Traveling Salesman Problem (BWTSP)(Bourgeois …