BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Computational Optimisation Group - ECPv6.15.11//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-ORIGINAL-URL:https://optimisation.doc.ic.ac.uk
X-WR-CALDESC:Events for Computational Optimisation Group
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:UTC
BEGIN:STANDARD
TZOFFSETFROM:+0000
TZOFFSETTO:+0000
TZNAME:UTC
DTSTART:20150101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=UTC:20160309T160000
DTEND;TZID=UTC:20160309T160000
DTSTAMP:20260404T022427
CREATED:20170124T102134Z
LAST-MODIFIED:20170124T102134Z
UID:542-1457539200-1457539200@optimisation.doc.ic.ac.uk
SUMMARY:Seminar: On Optimal selection of fixed-size populations: an application to tree breeding
DESCRIPTION:Title: On Optimal selection of fixed-size populations: an application to tree breedingSpeaker: Dr. Pietro BelottiAffiliation: FICO companyLocation: CPSE seminar room (C615 Roderic Hill)Time: 4:00pm \nAbstract. One of the problems that tree breeders face is the selection of a pedigree of trees with two aims: 1) conserving genetic diversity; 2) maximize response to selection. We tackled the problem of selecting a fixed-size breeding population while imposing a constraint on relatedness of the population members. The problem is expressed as a Mixed Integer Quadratically Constrained Optimization (MIQCO)\, in which a function is maximized subject to nonlinear quadratic constraints an discreteness of some variables\, and solved using a variant of the branch-and-bound method that uses a linear relaxation of the original problem. I will discuss details of the problem and of the algorithm (including a fast heuristic to find feasible solutions). I will also illustrate case studies of the selection of breeding populations for Scots pine and loblolly pine (Joint work with Tim Mullin\, Skogforsk\, the Swedish Forestry Research Institute). \nAbout the speaker. Pietro Belotti received a PhD in Computer Engineering in 2003 from the Technical University of Milan with a dissertation on optimal network design under survivability constraints. He has subsequently held a postdoctoral position at the Tepper School of Business\, Carnegie Mellon University\, a Visiting Professor post at the Department of Industrial and Systems Engineering\, Lehigh University\, and then an Assistant professor position at the department of Mathematical Sciences of Clemson University. He is currently working at Fair Isaac\, in the development team of the Xpress Optimizer. His research interests lie primarily in mixed integer nonlinear optimization\, robust optimization\, and discrete bi-objective optimization.
URL:https://optimisation.doc.ic.ac.uk/event/seminar-on-optimal-selection-of-fixed-size-populations-an-application-to-tree-breeding/
END:VEVENT
END:VCALENDAR