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 …

This article comprises the first theoretical and computational study on mixed integer
programming (MIP) models for the connected facility location problem (ConFL). ConFL …

The Steiner tree problem in graphs is a classical problem that commonly arises in practical
applications as one of many variants. While often a strong relationship between different …

In this paper we consider the NP-hard problem of determining the metric dimension of
graphs. We propose a genetic algorithm (GA) that uses the binary encoding and the …

In this paper a new evolutionary approach for solving the multi-level uncapacitated facility
location problem (MLUFLP) is presented. Binary encoding scheme is used with appropriate …

The concept of reduction has frequently distinguished itself as a pivotal ingredient of exact
solving approaches for the Steiner tree problem in graphs. In this article we broaden the …

The prize-collecting Steiner tree problem (PCSTP) is a well-known generalization of the
classic Steiner tree problem in graphs, with a large number of practical applications. It …

Given a connected node-weighted (di) graph, with a root node r, and a (possibly empty) set
of nodes R, the Rooted Maximum Node-Weight Connected Subgraph Problem (RMWCS) is …

The connected facility location (ConFL) problem generalizes the facility location problem
and the Steiner tree problem in graphs. Given a graph G=(V, E), a set of customers \calD⊆V …

In this paper we describe a genetic algorithm (GA) for the uncapacitated multiple allocation p-
hub center problem (UMApHCP). Binary coding is used and genetic operators adapted to …