Skip to main content
    ABSTRACT Nuclear Magnetic Resonance experiments can provide distances between pairs of atoms of a protein that are close enough and the problem is how to determine the 3D protein structure based on this partial distance information,... more
    ABSTRACT Nuclear Magnetic Resonance experiments can provide distances between pairs of atoms of a protein that are close enough and the problem is how to determine the 3D protein structure based on this partial distance information, called Molecular Distance Geometry Problem. It is possible to define an atomic order 1, ..., n and solve the problem iteratively using an exact method, called Branch-and-Prune (BP). The main step of BP algorithm is to solve a quadratic system to get the two possible positions for i, i > 3, in terms of the positions of i−3, i−2, i−1 and the distances d i−1, i , d i−2, i , d i−3, i . Because of uncertainty in NMR data, some of the distances d i−3, i may not be precise and the main problem to apply BP is related to the difficulty of obtaining an analytical expression of the position of atom i in terms of the positions of the three previous ones and the corresponding distances. We present such expression and although it is similar to one already existing in the literature, based on polyspherical coordinates, a new proof is given, based on Clifford algebra, and we also explain how such expression can be useful in BP using a parameterization which depends on d i−3, i . The results suggest that a master equation might exist, what is generally not believed by many researchers.
    The expansion of telecommunication services has increased the number of users sharing network resources. When a given service is highly demanded, some demands may be unmet due to the limited capacity of the network links. Moreover, for... more
    The expansion of telecommunication services has increased the number of users sharing network resources. When a given service is highly demanded, some demands may be unmet due to the limited capacity of the network links. Moreover, for such demands, telecommunication operators should pay penalty costs. To avoid rejecting demands, we can install more capacities in the existing network. In this
    1 Systems Engineering and Computer Science Program œ UFRJ œ Rio de Janeiro, Brazil 2 Institute of Computing œ University of Campinas, Campinas, Brazil 3 Department of Informatics œ PUC-Rio œ Rio de Janeiro, Brazil ... This paper... more
    1 Systems Engineering and Computer Science Program œ UFRJ œ Rio de Janeiro, Brazil 2 Institute of Computing œ University of Campinas, Campinas, Brazil 3 Department of Informatics œ PUC-Rio œ Rio de Janeiro, Brazil ... This paper introduces the Brazilian Institute for ...
    ABSTRACT
    The purpose of this paper is to investigate branch and bound strategies and the comparison of branch and cut with pure branch and bound approaches on high speed telecommunication network design under uncertainty. We model the problem as a... more
    The purpose of this paper is to investigate branch and bound strategies and the comparison of branch and cut with pure branch and bound approaches on high speed telecommunication network design under uncertainty. We model the problem as a two-stage stochastic program with discrete first-stage (investment) variables. Two formulations of the problem are used. The first one with general integer investment variables and the second one, a variant of the first model, with 0-1 investment variables. We present computational results for three solution approaches: the integer L-shaped (Benders) decomposition, a branch and bound framework and a disjunctive cutting plane method.
    This paper addresses multicriteria combinatorial optimization problems involving one cost and several bottleneck objective functions. An algorithm is developed which generates the minimal complete set of Pareto-optimal solutions. This... more
    This paper addresses multicriteria combinatorial optimization problems involving one cost and several bottleneck objective functions. An algorithm is developed which generates the minimal complete set of Pareto-optimal solutions. This algorithm runs in polynomial time as long as the single objective problem considering only the cost function can be solved polynomially. A reoptimization procedure is used to accelerate the convergence of