Search results for "Branch"
showing 10 items of 1278 documents
Following the Phoenician example: western Mediterranean colonization by <em>Spirobranchus</em> cf. <em>tetraceros</em> (Annel…
2020
A newly established population of the fouling polychaete Spirobranchus cf. tetraceros is reported from the western Mediterranean (Valencia Port). Despite previous intensive surveys, this is the first record for the taxon in the Iberian Peninsula. Molecular analyses revealed that S. cf. tetraceros from Valencia are genetically identical to specimens from Heraklion, Crete, but different from those collected in the Red Sea and S. tetraceros sensu stricto from the type locality in Australia. Mediterranean and Red Sea S. cf. tetraceros form a well-supported monophyletic clade but are clearly distinct from New South Wales specimens of S. tetraceros. Our new molecular evidence supports the hypothe…
A branch-and-cut algorithm for the soft-clustered vehicle-routing problem
2021
Abstract The soft-clustered vehicle-routing problem is a variant of the classical capacitated vehicle-routing problem (CVRP) in which customers are partitioned into clusters and all customers of the same cluster must be served by the same vehicle. We introduce a novel symmetric formulation of the problem in which the clustering part is modeled with an asymmetric sub-model. We solve the new model with a branch-and-cut algorithm exploiting some known valid inequalities for the CVRP that can be adapted. In addition, we derive problem-specific cutting planes and new heuristic and exact separation procedures. For square grid instances in the Euclidean plane, we provide lower-bounding techniques …
Stable maps from surfaces to the plane with prescribed branching data
2007
Abstract We consider the problem of constructing stable maps from surfaces to the plane with branch set a given set of curves immersed (except possibly with cusps) in the plane. Various constructions are used (1) piecing together regions immersed in the plane (2) modifying an existing stable map by a sequence of codimension one transitions (swallowtails etc) or by surgeries. In (1) the way the regions are pieced together is described by a bipartite graph (an edge C* corresponds to a branch curve C with the vertices of C* corresponding to the two regions containing C). We show that any bipartite graph may be realized by a stable map and we consider the question of realizing graphs by fold ma…
Search for WH production with a light Higgs boson decaying to prompt electron-jets in proton–proton collisions at \(\sqrt {s}=7\) TeV with the ATLAS…
2013
A search is performed for WH production with a light Higgs boson decaying to hidden-sector particles resulting in clusters of collimated electrons, known as electron-jets. The search is performed with 2.04 fb[superscript −1] of data collected in 2011 with the ATLAS detector at the Large Hadron Collider in proton–proton collisions at √s=7 TeV . One event satisfying the signal selection criteria is observed, which is consistent with the expected background rate. Limits on the product of the WH production cross section and the branching ratio of a Higgs boson decaying to prompt electron-jets are calculated as a function of a Higgs boson mass in the range from 100 to 140 GeV.
Branch-and-cut algorithms for the vehicle routing problem with trailers and transshipments
2013
This article studies the vehicle routing problem with trailers and transshipments VRPTT, a practically relevant, but challenging, generalization of the classical vehicle routing problem. The article makes three contributions: i Building on a nontrivial network representation, two mixed-integer programming formulations for the VRPTT are proposed. ii Based on these formulations, five different branch-and-cut algorithms are developed and implemented. iii The computational behavior of the algorithms is analyzed in an extensive computational study, using a large number of test instances designed to resemble real-world VRPTTs.Copyright © 2013 Wiley Periodicals, Inc. NETWORKS, Vol. 631, 119-133 20…
Random walks in dynamic random environments and ancestry under local population regulation
2015
We consider random walks in dynamic random environments, with an environment generated by the time-reversal of a Markov process from the oriented percolation universality class. If the influence of the random medium on the walk is small in space-time regions where the medium is typical, we obtain a law of large numbers and an averaged central limit theorem for the walk via a regeneration construction under suitable coarse-graining. Such random walks occur naturally as spatial embeddings of ancestral lineages in spatial population models with local regulation. We verify that our assumptions hold for logistic branching random walks when the population density is sufficiently high.
The geography of Spanish bank branches
2014
This article analyzes the determinants of bank branch location in Spain taking the role of geography explicitly into account. After a long period of intense territorial expansion, especially by savings banks, many of these firms are now involved in merger processes triggered off by the financial crisis, most of which entail the closing of many branches. However, given the contributions of this type of banks to limit financial exclusion, this process might exacerbate the consequences of the crisis for some disadvantaged social groups. Related problems such as new banking regulation initiatives (Basel III), or the current excess capacity in the sector add further relevance to this problem. We…
A GALTON-WATSON BRANCHING PROCESS IN VARYING ENVIRONMENTS WITH ESSENTIALLY CONSTANT OFFSPRING MEANS AND TWO RATES OF GROWTH1
1983
Summary A Galton-Watson process in varying environments (Zn), with essentially constant offspring means, i.e. E(Zn)/mnα∈(0, ∞), and exactly two rates of growth is constructed. The underlying sample space Ω can be decomposed into parts A and B such that (Zn)n grows like 2non A and like mnon B (m > 4).
Graphical representation of some duality relations in stochastic population models
2007
We derive a unified stochastic picture for the duality of a resampling-selection model with a branching-coalescing particle process (cf. http://www.ams.org/mathscinet-getitem?mr=MR2123250) and for the self-duality of Feller's branching diffusion with logistic growth (cf. math/0509612). The two dual processes are approximated by particle processes which are forward and backward processes in a graphical representation. We identify duality relations between the basic building blocks of the particle processes which lead to the two dualities mentioned above.
A Galton–Watson process with a threshold
2016
Abstract In this paper we study a special class of size dependent branching processes. We assume that for some positive integer K as long as the population size does not exceed level K, the process evolves as a discrete-time supercritical branching process, and when the population size exceeds level K, it evolves as a subcritical or critical branching process. It is shown that this process does die out in finite time T. The question of when the mean value E(T) is finite or infinite is also addressed.