The Steiner tree problem (STP) in graphs is one of the most studied problems in
combinatorial optimization. Since its inception in 1970, numerous articles published in the …

Beginning in the 1960s, techniques from operations research began to be used to generate
political districting plans. A classical example is the integer programming model of Hess et …

During several applications, such as search and rescue, robots must discover new
information about the environment and, at the same time, share operational knowledge with …

Several major environmental issues like biodiversity loss and climate change currently
concern the international community. These topics that are related to the development of …

In many network applications, one searches for a connected subset of vertices that exhibits
other desirable properties. To this end, this paper studies the connected subgraph polytope …

In multirobot exploration under centralized control, communication plays an important role in
constraining the team exploration strategy. Recurrent connectivity is a way to define …

This paper studies two location problems with interconnected facilities. In the first problem,
all customers need to be served by open facilities, and in the second (covering) variant a …

Wildlife corridors are often used to connect critical habitat for species protection. Mixed
integer programming models have been used in the past to create wildlife corridors, but they …

Borne out of a surprising variety of practical applications, the maximum-weight connected
subgraph problem has attracted considerable interest in recent years. This interest has not …

The design of nature reserves is becoming, more and more, a crucial task for ensuring the
conservation of endangered wildlife. In order to guarantee the preservation of species and a …