A branch-and-price approach to p-median location problems

This paper describes a branch-and-price algorithm for the p-median location problem. The objective is to locate p facilities (medians) such as the sum of the distances from each demand point to its nearest facility is minimized. The traditional column generation process is compared with a stabilized approach that combines the column generation and Lagrangean/surrogate relaxation. The Lagrangean/surrogate multiplier modifies; the reduced cost criterion, providing the selection of new productive columns at the search tree. Computational experiments are conducted considering especially difficult instances to the traditional column generation and also with some large-scale instances. (C) 2004 Elsevier Ltd. All rights reserved.

Insights into metal ion binding in phospholipases A(2): ultra high-resolution crystal structures of an acidic phospholipase A(2) in the Ca2+ free and bound states

The electrophile Ca2+ is an essential multifunctional co-factor in the phospholipase A(2) mediated hydrolysis of phospholipids. Crystal structures of an acidic phospholipase A(2) from the venom of Bothrops jararacussu have been determined both in the Ca2+ free and bound states at 0.97 and 1.60 angstrom resolutions, respectively. In the Ca2+ bound state, the Ca2+ ion is penta-coordinated by a distorted pyramidal cage of oxygen and nitrogen atoms that is significantly different to that observed in structures of other Group I/II phospholipases A(2). In the absence of Ca2+, a water molecule occupies the position of the Ca2+ ion and the side chain of Asp49 and the calcium-binding loop adopts a different conformation. (c) 2005 Elsevier SAS. All rights reserved.

Soluble and bound peroxidases from papaya fruit

Soluble and bound peroxidases were isolated from the pulp of ripening papaya fruit. During papaya ripening, soluble and bound peroxidase activities increased 2.5- and 4.2-fold, respectively. Soluble peroxidase was purified 59-fold by ammonium sulphate precipitation and chromatography on Sephadex G-25, DEAE-cellulose and Sephadex G-100. Bound peroxidase was purified 140-fold by ammonium sulphate precipitation and chromatography on Sephadex G-100 and DEAE-cellulose. Polyacrylamide gel electrophoresis of the purified preparations revealed that both enzymes were highly purified by the procedures adopted. The soluble and bound forms had a Mr of 41 000 and 54 000, respectively. Soluble and bound peroxidases showed optimum activity at pH 6.0 and 5.5, respectively, and were inhibited by p-chloromercuribenzoate, iodoacetamide, N-ethylmaleimide, potassium cyanide and Fe2+. Soluble peroxidase was activated by ammonium sulphate and this activation was prevented by cyanide. © 1990.

Scattering and bound states of fermions in a mixed vector-scalar smooth step potential

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Scattering and bound states of fermions in the modified Hulthen potential

In the present work the scattering of a fermion in the modified Hulthen potential is considered with a general vector and scalar and we solved the Dirac equation in the one-dimensional space. The transmission and reflection coefficients are reported. The bound-state solution is also given. The study shows the asymptotic behavior of the wave function in bound-state and scattering states solutions.

A matheuristic for the selection of beam directions and dose distribution in radiotherapy planning

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Interior point algorithm for linear programming used in transmission network synthesis

This article presents a well-known interior point method (IPM) used to solve problems of linear programming that appear as sub-problems in the solution of the long-term transmission network expansion planning problem. The linear programming problem appears when the transportation model is used, and when there is the intention to solve the planning problem using a constructive heuristic algorithm (CHA), ora branch-and-bound algorithm. This paper shows the application of the IPM in a CHA. A good performance of the IPM was obtained, and then it can be used as tool inside algorithm, used to solve the planning problem. Illustrative tests are shown, using electrical systems known in the specialized literature. (C) 2005 Elsevier B.V. All rights reserved.

Searching for larval support for majoid families (Crustacea : Brachyura) with particular reference to Inachoididae Dana, 1851

We re-evaluated the larval support for families within majoids using the Wilcoxon signed-rank test with emphasis on Inachoididae. To accomplish our objectives, we added 10 new taxa, two of which are traditionally assigned to the family of special interest, to a previous larval database for majoids, and re-appraised the larval characters used in earlier studies. Phylogenetic analysis was performed with PAUP* using the heuristic search with 50 replicates or the branch-and-bound algorithm when possible. Multi-state transformation series were considered unordered; initially characters were equally weighted followed by successive weighting, and trees were rooted at the Oregoniidae node. Ten different topological constraints were enforced for families to evaluate tree length under the assumption of monophyly for each taxonomic entity. Our results showed that the tree length of most constrained topologies was not considerably greater than that of unconstrained analysis in which most families nested as paraphyletic taxa. This may indicate that the present larval database does not provide strong support for paraphyly of the taxa in question. For Inachoididae, although the Wilcoxon signed-rank test rejected a significant difference between unconstrained and constrained cladograms, we were unable to provide a single synapomorphy for this clade. Except for the conflicting position of Leurocyclus and Stenorhynchus, the two clades correspond to the traditional taxonomic arrangement. Among inachoidids, the clade (Anasimus (Paradasygyius (Collodes + Pyromaia))) is supported, whereas for inachids, the clade (Inachus (Macropodia + Achaeus)) is one of the most supported clades within majids. As often stated, only additional characters will provide a better test for the monophyly of Inachoididae and other families within Majoidea.

O problema de corte de placas defeituosas

O problema tratado neste trabalho consiste em cortar uma placa retangular em peças menores retangulares, de modo que a perda seja minimizada. A placa, entretanto, contém defeitos bem localizados. Propomos uma abordagem em grafo E/OU para representação das soluções possíveis e um método de enumeração implícita para determinar a solução ótima. Resultados computacionais demonstram a efetividade da abordagem.

Global optimization approach for the H2-norm model reduction problem

A branch and bound algorithm is proposed to solve the H2-norm model reduction problem for continuous-time linear systems, with conditions assuring convergence to the global optimum in finite time. The lower and upper bounds used in the optimization procedure are obtained through Linear Matrix Inequalities formulations. Examples illustrate the results.

Otimização global para os problemas de redução H2 de modelos e redução H2 da ordem do controlador

A branch and bound algorithm is proposed to solve the H2-norm model reduction problem and the H2-norm controller reduction problem, with conditions assuring convergence to the global optimum in finite time. The lower and upper bounds used in the optimization procedure are obtained through linear matrix inequalities formulations. Examples illustrate the results.

Global optimization for the ℋ∞-norm model reduction problem

A branch and bound algorithm is proposed to solve the [image omitted]-norm model reduction problem for continuous and discrete-time linear systems, with convergence to the global optimum in a finite time. The lower and upper bounds in the optimization procedure are described by linear matrix inequalities (LMI). Also proposed are two methods with which to reduce the convergence time of the branch and bound algorithm: the first one uses the Hankel singular values as a sufficient condition to stop the algorithm, providing to the method a fast convergence to the global optimum. The second one assumes that the reduced model is in the controllable or observable canonical form. The [image omitted]-norm of the error between the original model and the reduced model is considered. Examples illustrate the application of the proposed method.

Optimal energy generation with biomass of sugarcane harvest

The aim of this work is the application of the Interior Point and Branch and Bound methods in multiobjective optimization models related to sugarcane harvest residual biomass. These methods showed their viability to help on choosing the sugarcane planting varieties, searching to optimize cost and energy balance of harvest residual biomass, which have conflitant objectives. These methods provide satisfactory results, with fair computing performance and reliable and consistent solutions to the analyzed models. © 2011 IEEE.

Domain reduction using GRASP construction phase for transmission expansion planning problem

This paper proposes a new strategy to reduce the combinatorial search space of a mixed integer linear programming (MILP) problem. The construction phase of greedy randomized adaptive search procedure (GRASP-CP) is employed to reduce the domain of the integer variables of the transportation model of the transmission expansion planning (TM-TEP) problem. This problem is a MILP and very difficult to solve specially for large scale systems. The branch and bound (BB) algorithm is used to solve the problem in both full and the reduced search space. The proposed method might be useful to reduce the search space of those kinds of MILP problems that a fast heuristic algorithm is available for finding local optimal solutions. The obtained results using some real test systems show the efficiency of the proposed method. © 2012 Springer-Verlag.

An iterated sample construction with path relinking method: Application to switch allocation in electrical distribution networks

We present a metaheuristic approach which combines constructive heuristics and local searches based on sampling with path relinking. Its effectiveness is demonstrated by an application to the problem of allocating switches in electrical distribution networks to improve their reliability. Our approach also treats the service restoration problem, which has to be solved as a subproblem, to evaluate the reliability benefit of a given switch allocation proposal. Comparisons with other metaheuristics and with a branch-and-bound procedure evaluate its performance. © 2012 Published by Elsevier Ltd.