EDP Sciences Journals List
Home Document
Subscriber Authentication Point
Open Access Option
Free access article

Issue Genet. Sel. Evol.
Volume 39, Number 1, January-February 2007
Page(s) 3 - 25
DOI 10.1051/gse:2006031

References of  Genet. Sel. Evol. 39 (2007) 3-25
  1. Alizadeh F., Haeberly J.P.A., Overton M.L., Primal-dual interior point methods for semidefinite programming: convergence rates, stability and numerical results, SIAM J. Optim. 8 (1998) 746-768 [CrossRef] [MathSciNet].
  2. Belonsky G.M., Kennedy B.W., Selection on individual phenotype and best linear unbiased predictor of breeding value in a closed swine herd, J. Anim. Sci. 66 (1988) 1124-1131 [PubMed].
  3. Benson S.J., Yinyu Y., DSDP5: Software for Semidefinite programming, ACM Trans. Math. Software (2005) http://www.stanford.edu/~yyye/DSDP5-Paper.pdf.
  4. Borchers B., CSDP, A C library for semidefinite programming, Optim. Methods Softw. 11 (1999) 613-623 [MathSciNet].
  5. Boyd S., Vandenberghe L., Convex programming, Cambridge University Press (2005).
  6. Brisbane J.R., Gibson J.P., Balancing selection response and rate of inbreeding by including genetic-relationships in selection decisions, Theor. Appl. Genet. 91 (1995) 421-431.
  7. Colleau J.J., Moureaux S., Briend J.B., A method for the dynamic management of variability in dairy cattle, Genet. Sel. Evol. 36 (2004) 373-394 [EDP Sciences] [CrossRef] [PubMed].
  8. Dekkers J.C.M., van Arendonk J.A.M., Optimizing selection for quantitative traits with information on an identified locus in outbred populations, Genet. Res. Camb. 71 (1998) 257-275.
  9. Fernando R.L., Grossman M., Marker assisted selection using best linear unbiased prediction, Genet. Sel. Evol. 21 (1989) 467-477.
  10. Fujisawa K., Kojima M., Nakata K., Yamashita M., SDPA (SemiDefinite Programming Algorithm) user's manual - version 6.00. Research Reports on Mathematical and Computer Sciences (2002) Series B: Operations Research.
  11. Grundy B., Villanueva B., Woolliams J.A., Dynamic selection procedures for constrained inbreeding and their consequences for pedigree development, Genet. Res., Camb. 72 (1998) 159-168.
  12. Karmarkar N., A new polynomial-time algorithm for linear programming, Combinatorica 4 (1984) 373-395 [MathSciNet].
  13. Kinghorn B.P., Meszaros S.A., Vagg R.D., Dynamic tactical decision systems for animal breeding, in: Proc. 7th World Congr. Genet. Appl. Livest. Prod. (2002) CD-ROM Communications 23-07.
  14. Laurent M., Rendl F., Semidefinite programming and integer programming, in: Ardal K., Nemhauser G.L., Weismantel R. (Eds.), Handbooks in Operations Research and Management Science: Discrete Optimization, Elsevier, Amsterdam (2005) pp. 393-514.
  15. Meuwissen T.H.E., Maximizing the response of selection with a predefined rate of inbreeding, J. Anim. Sci. 75 (1997) 934-940 [PubMed].
  16. Meuwissen T.H.E., Hayes B.J., Goddard M.E., Prediction of genetic value using genome-wide dense marker maps, Genetics 157 (2001) 1819-1829 [PubMed].
  17. Nesterov Y., Nemirovsky A., A general approach to polynomial-time algorithms design for convex programming, Technical Report (1988) Centr. Econ. & Math. Inst., USSR Acad. Sci., Moscow, USSR.
  18. Nesterov Y., Nemirovsky A., Interior-point polynomial methods in convex programming, Studies in Applied Mathematics, Vol. 13. SIAM, Philadelphia, PA (1994).
  19. Pong-Wong R., Woolliams J.A., Response to mass selection when an identified major gene is segregating, Genet. Sel. Evol. 30 (1998) 313-337.
  20. Vandenberghe L., Boyd S., Semidefinite programming, SIAM Review 38 (1996) 49-95 [CrossRef] [MathSciNet].
  21. Villanueva B., Pong-Wong R., Grundy B.,Woolliams J.A., Potential benefit from using an identified major gene and BLUP estimated breeding values in selection programmes, Genet. Sel. Evol. 31 (1999) 115-133.
  22. Villanueva B., Pong-Wong R., Woolliams J.A., Marker assisted selection with optimized contributions of the candidates to selection, Genet. Sel. Evol. 34 (2002) 679-703 [EDP Sciences] [CrossRef] [PubMed].
  23. Woolliams J.A., Modifications to MOET nucleus schemes to improve rates of genetic progress and decrease rates of inbreeding in diary-cattle, Anim. Prod. 49 (1989) 1-14.
  24. Woolliams J.A., Meuwissen T.H.E., Decision rules and variance of response in breeding schemes, Anim. Prod. 56 (1993) 179-186.
  25. Woolliams J.A., Thompson R., A theory of genetic contributions, Proc. 5th World Cong. Genet. Appl. Livest. Prod. 25 (1994) 127-134.
  26. Woolliams J.A., Pong-Wong R., Villanueva B., Strategic optimisation of short- and long- term gain and inbreeding in MAS and non-MAS schemes, in: Proc. 7th World Congr. Genet. Appl. Livest. Prod. (2002) CD-ROM Communications 23-02.
  27. Wray N.R., Goddard M.E., Increasing long-term response to selection, Genet. Sel. Evol. 26 (1994) 431-451.
  28. Wu S.P., Boyd S., DPSOL: A parser/solver for semidefinite programs with matrix structure, in: El Ghaoui L., Niculescu S.I. (Eds.), Advances in linear matrix inequality methods in control, SIAM, 2000, pp. 79-91.



What is OpenURL?

The OpenURL standard is a protocol for transmission of metadata describing the resource that you wish to access. An OpenURL link contains article metadata and directs it to the OpenURL server of your choice. The OpenURL server can provide access to the resource and also offer complementary services (specific search engine, export of references...). The OpenURL link can be generated by different means.
  • If your librarian has set up your subscription with an OpenURL resolver, OpenURL links appear automatically on the abstract pages.
  • You can define your own OpenURL resolver with your EDPS Account. In this case your choice will be given priority over that of your library.
  • You can use an add-on for your browser (Firefox or I.E.) to display OpenURL links on a page (see http://www.openly.com/openurlref/). You should disable this module if you wish to use the OpenURL server that you or your library have defined.