Search results for "branch"
showing 10 items of 1278 documents
Study of high-multiplicity three-prong and five-prong τ decays at BABAR
2012
We present measurements of the branching fractions of three-prong and five-prong tau decay modes using a sample of 430 million tau lepton pairs, corresponding to an integrated luminosity of 468 fb(-1), collected with the BABAR detector at the PEP-II asymmetric-energy e_e storage rings at SLAC National Accelerator Laboratory. The tau(-) -> (3 pi)(-) eta nu(tau), tau(-) -> (3 pi)(-) omega nu(tau), and tau(-) f(1) (1285)nu(tau) branching fractions are presented, as well as a new limit on the branching fraction of the second-class current decay tau(-) -> pi(-) eta'(958)nu(tau). We search for the decay mode tau(-) -> K- eta'(958)nu(tau) and for five-prong decay modes with kaons, and place the fi…
Achieving branched polyethylene waxes by aryliminocycloocta[b]pyridylnickel precatalysts: Synthesis, characterization, and ethylene polymerization
2017
Cycloocta[b]pyridin-10-one was prepared to form the corresponding imino derivatives, which then reacted with (DME)NiBr2 to form 10-aryliminocycloocta[b]pyridylnickel bromides (Ni1–Ni5). The new compounds were characterized by means of FT-IR spectroscopy as well as elemental analysis and the organic ligands were also analyzed by the NMR measurements. Furthermore, the molecular structure of a representative complex Ni3 was determined by the single crystal X-ray diffraction, indicating the distorted tetrahedral geometry around the nickel atom. Upon the activation with either methylaluminoxane (MAO) or diethylaluminium chloride (Et2AlCl), the title nickel complexes exhibited high activity in et…
A Branch-Price-and-Cut Algorithm for the Min-Max k -Vehicle Windy Rural Postman Problem
2013
[EN] The min-max k -vehicles windy rural postman problem consists of minimizing the maximal distance traveled by a vehicle to find a set of balanced routes that jointly service all the required edges in a windy graph. This is a very difficult problem, for which a branch-and-cut algorithm has already been proposed, providing good results when the number of vehicles is small. In this article, we present a branch-price-and-cut method capable of obtaining optimal solutions for this problem when the number of vehicles is larger for the same set of required edges. Extensive computational results on instances from the literature are presented.
The Steiner Traveling Salesman Problem and its extensions
2019
Abstract This paper considers the Steiner Traveling Salesman Problem, an extension of the classical Traveling Salesman Problem on an incomplete graph where not all vertices have demand. Some extensions including several depots or location decisions are introduced, modeled and solved. A compact integer linear programming formulation is proposed for each problem, where the routes are represented with two-index decision variables, and parity conditions are modeled using cocircuit inequalities. Exact branch-and-cut algorithms are developed for all formulations. Computational results obtained confirm the good performance of the algorithms. Instances with up to 500 vertices are solved optimally.
Branch and bound for the cutwidth minimization problem
2013
The cutwidth minimization problem consists of finding a linear arrangement of the vertices of a graph where the maximum number of cuts between the edges of the graph and a line separating consecutive vertices is minimized. We first review previous approaches for special classes of graphs, followed by lower bounds and then a linear integer formulation for the general problem. We then propose a branch-and-bound algorithm based on different lower bounds on the cutwidth of partial solutions. Additionally, we introduce a Greedy Randomized Adaptive Search Procedure (GRASP) heuristic to obtain good initial solutions. The combination of the branch-and-bound and GRASP methods results in optimal solu…
Intramolecular charge transfer and dual fluorescence of 4-(dimethylamino)benzonitrile: ultrafast branching followed by a two-fold decay mechanism.
2011
International audience; In this contribution we present new experimental and theoretical results for the intramolecular charge transfer (ICT) reaction underlying the dual fluorescence of 4-(dimethylamino) benzonitrile ( DMABN), which indicate that the fully twisted ICT (TICT) state is responsible for the time-resolved transient absorption spectrum while a distinct partially twisted ICT (pTICT) structure is suggested for the fluorescent ICT state.
High resolution 80Se(n,γ) cross section measurement at CERN n_TOF and development of the novel i-TED detection system
2022
El proceso (-s) de captura lenta de neutrones es responsable de la formación de la mitad de los elementos más pesados que el hierro en el universo. A pesar de la larga escala de tiempo de este proceso, la larga vida media de algunos isótopos inestables a lo largo del flujo de reacción del proceso-s crea puntos de ramificación que conducen a una división de la ruta de la nucleosíntesis. 79Se (t1/2 = 3.27 x 10^5 y) representa uno de los núcleos ramificados-s más relevantes y debatidos por dos razones principales. Por un lado, la existencia de estados excitados de baja energía en el 79Se, cuya población puede variar con la temperatura del medio estelar, hace que el patrón de abundancia local…
A Branch-and-Cut method for the Capacitated Location-Routing Problem
2011
International audience; Recent researches in the design of logistic networks have shown that the overall distribution cost may be excessive if routing decisions are ignored when locating depots. The Location-Routing Problem (LRP) overcomes this drawback by simultaneously tackling location and routing decisions. The aim of this paper is to propose an exact approach based on a Branch-and-Cut algorithm for solving the LRP with capacity constraints on depots and vehicles. The proposed method is based on a zero-one linear model strengthened by new families of valid inequalities. The computational evaluation on three sets of instances (34 instances in total), with 5–10 potential depots and 20–88 …
A computational study of LP-based heuristic algorithms for two-dimensional guillotine cutting stock problems
2002
In this paper we develop and compare several heuristic methods for solving the general two-dimensional cutting stock problem. We follow the Gilmore-Gomory column generation scheme in which at each iteration a new cutting pattern is obtained as the solution of a subproblem on one stock sheet. For solving this subproblem, in addition to classical dynamic programming, we have developed three heuristic procedures of increasing complexity, based on GRASP and Tabu Search techniques, producing solutions differing in quality and in time requirements. In order to obtain integer solutions from the fractional solutions of the Gilmore-Gomory process, we compare three rounding procedures, rounding up, t…
In-Depth Analysis of Pricing Problem Relaxations for the Capacitated Arc-Routing Problem
2015
Recently, Bode and Irnich [Bode C, Irnich S (2012) Cut-first branch-and-price-second for the capacitated arc-routing problem. Oper. Res. 60(5):1167–1182] presented a cut-first branch-and-price-second algorithm for solving the capacitated arc-routing problem (CARP). The fundamental difference to other approaches for exactly solving the CARP is that the entire algorithm works directly on the typically sparse underlying graph representing the street network. This enables the use of highly efficient dynamic programming-based pricing algorithms to solve the column-generation subproblem also known as the pricing problem. The contribution of this paper is the in-depth analysis of the CARP pricing…