This paper presents two new mathematical formulations for the Point-Feature Cartographic Label Placement Problem (PFCLP ) and a new Lagrangean relaxation with clusters (LagClus) t...
Glaydston Mattos Ribeiro, Luiz Antonio Nogueira Lo...
We consider a generalization of the Prize Collecting Steiner Tree Problem on a graph with special redundancy requirements on a subset of the customer nodes suitable to model a rea...
So-called nonadjacent representations are commonly used in elliptic curve cryptography to facilitate computing a scalar multiple of a point on an elliptic curve. A nonadjacent rep...
This paper extends the domain theoretic method for solving initial value problems, described in [8], to unbounded vector fields. Based on a sequence of approximations of the vecto...
In this paper we introduce a direct motivation for solving the minimum 2-sum problem, for which we present a linear-time algorithm inspired by the Algebraic Multigrid approach whi...