In our model, individuals are autopolyploid with either four (Y 4) or six (Y 6) sets of chromosomes (that is, 2n=4x=tetraploid; 2n=6x=hexaploid), but all populations must have the same ploidy level ...
This is a preview. Log in through your library . Abstract In this paper, a branch and bound algorithm is presented for solving network design problems (NDP). Route selection for the NDP is based on a ...
This paper describes a simple calculation for the assignment and transportation problems which is "dual to" the well-known Hungarian Method. While the Hungarian is a dual method, this method is primal ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback