نتایج جستجو برای: route branch indices

تعداد نتایج: 229448  

2012
Mohammad Salehi

In order to evaluation of drought resistant indices in barley (Hordeum vulgare L.), 10 barley genotypes evaluated in Completely Randomized Design with three Replications in two conditions, (under drought stress and in normal with irrigation in planting, flowering and grain filling stages) in Islamic Azad University, Miyaneh Branch Research Farm in 2012. Drought tolerant indices basis of yield p...

Journal: :پژوهش های زراعی ایران 0

to achieve high seed yield of rapeseed varieties under semi cold rainfed conditions; twenty rapeseed varieties were compared in randomized complete block design with three replications in sararood agricultural research station for two years. combined analysis results indicated that there were significant differences at 5% probability level among years for number of days to start of flowering, n...

2015
Yaohua Xiong Keping Li

13 Abstract Transport assignment models play an important role in the research and practice of transport planning. Traditionally, transport assignment models are link-based, predicting traffic volumes on network links. However, route-based transport assignment models, which work with route sets and determine traffic volumes of routes, became more important in recent years. They support advanced...

Journal: :IEEE Communications Letters 2022

In this letter, a novel supplementary index bit aided transmit diversity (SIB-TD) approach is proposed for an enhanced discrete cosine transform based orthogonal frequency division multiplexing with modulation (EDCT-OFDM-IM) system. Specifically, conventional (IM) employed the first antenna, i.e., main branch, and non-activated subcarriers’ indices in one group are utilized IM mapping on same s...

Journal: :Informatica (Slovenia) 2015
Achim Hildenbrandt Gerhard Reinelt

The target visitation problem (TVP) is concerned with finding a route to visit a set of targets starting from and returning to some base. In addition to the distance traveled a tour is evaluated by taking also preferences into account which address the sequence in which the targets are visited. The problem thus is a combination of two well-known combinatorial optimization problems: the travelin...

Journal: :Math. Program. 1999
Oktay Günlük

We present a branch-and-cut algorithm to solve capacitated network design problems. Given a capacitated network and point-to-point traac demands, the objective is to install more capacity on the edges of the network and route traac simultaneously, so that the overall cost is minimized. We study a mixed-integer programming formulation of the problem and identify some new facet deening inequaliti...

2005
Verena Voelter Alessia Pica Julien Laurent Donata Rimoldi Hanifa Bouzourene Ali Sajadi Maurice Matter Pedro Romero Nathalie Rufer Daniel E. Speiser

1Multidisciplinary Oncology Center, University of Lausanne Hospitals (CHUV), Lausanne, Switzerland 2Department of Radio-Oncology, CHUV, Lausanne, Switzerland 3Division of Experimental Oncology, Multidisciplinary Oncology Center, CHUV, Lausanne, Switzerland 4Division of Clinical Onco-Immunology, Ludwig Institute for Cancer Research, Lausanne Branch, Lausanne, Switzerland 5Department of Pathology...

2009
Daniel J. Fazakerley Scott P. Lawrence Vladimir A. Lizunov Samuel W. Cushman Geoffrey D. Holman

A common trafficking route for GLUT4 in cardiomyocytes in response to insulin, contraction and energy-status signalling Daniel J. Fazakerley1, Scott P. Lawrence1, Vladimir A. Lizunov2, Samuel W. Cushman3 and Geoffrey D. Holman1,* 1Department of Biology and Biochemistry, University of Bath, Claverton Down, Bath BA2 7AY, UK 2Laboratory of Cellular and Molecular Biophysics, Program on Physical Bio...

Journal: :Computers & OR 2013
Benjamin Dussault Bruce L. Golden Chris Groër Edward A. Wasil

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید