The positioning of laser scanners for indoor surveying is still a time and cost expensive
process. This article proposes an optimization approach for computing an admissible sensor …

Abstract The Art Gallery Problem (AGP) is one of the most well-known problems in
Computational Geometry (CG), with a rich history in the study of algorithms, complexity, and …

The art gallery problem (AGP) is one of the classical problems in computational geometry. It
asks for the minimum number of guards required to achieve visibility coverage of a given …

Investing vast amounts of money with the goal of fostering medium to long-term growth in
returns is a challenging task in financial optimization. A method might be mirroring the …

In this paper, we are interested in studying the maximum ratio clique problem (MRCP) that is
a variant of the classical maximum weight clique problem. For a given graph, we suppose …

Consider a graph in which every vertex has two non-negative weights. In this graph, the
maximum ratio clique problem (MRCP) searches for a maximal clique that maximizes a …

Suppose that an art gallery is represented by a polygon. The objective of the Art Gallery
Problem (AGP) consists in finding the minimum number of guards that we need to oversee …

The Art Gallery Problem (AGP) is one of the classic problems in Computational Geometry.
For a given art gallery, represented by a polygon, the AGP seeks for the minimum number of …

In this paper we consider a generalization of the Markowitz's Mean-Variance model under
linear transaction costs and cardinality constraints. The cardinality constraints are used to …