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 …

Social platforms became a major source of rumours. While rumours can have severe real-
world implications, their detection is notoriously hard: Content on social platforms is short …

The Steiner tree problem is a challenging NP-hard problem. Many hard instances of this
problem are publicly available, that are still unsolved by state-of-the-art branch-and-cut …

Web platforms, especially social media, are facing a new and ever-evolving cyber threat
operating at the information level. Their open nature allows a high velocity flow of rumours …

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 …

This paper proposes a new evolutionary algorithm, called DSMGA-II, to efficiently solve
optimization problems via exploiting problem substructures. The proposed algorithm adopts …

The destructive potential of wildfires has been exacerbated by climate change, causing their
frequencies and intensities to continuously increase globally. Generating fire-resilient …

Despite the rapid growth of micromobility, and e-scooters in particular, there is no systematic
approach for designing a contiguous service region with fleet allocation and responsive …

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 …

Given a graph with a weight associated with each vertex, the maximum weighted induced
forest problem (MWIF) consists of encountering a maximum weighted subset of the vertices …