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 ...

The traffic assignment problem (TAP) with elastic demands can be formulated as an optimization problem, the objective of which is the sum of a congestion function and a disutility function. We propose ...