<?phpxml version="1.0" encoding="ISO-8859-1"?>
 <collection>
  

 
<record>
 <datafield tag="088" ind1="" ind2="">
  <subfield code="a">BierCore07</subfield> 
  </datafield>
<datafield tag="909" ind1="C" ind2="0">
<subfield code="p">TRANSP-OR</subfield>
</datafield>
<datafield tag="980" ind1="" ind2="">
<subfield code="a">TALK</subfield>
</datafield>
 <datafield tag="700" ind1="" ind2="">
  <subfield code="a">Bierlaire, Michel</subfield> 
  </datafield>
<datafield tag="245" ind1="" ind2="">
<subfield code="a">
Discrete choice models and heuristics for global nonlinear optimization</subfield>
</datafield>
<datafield tag="260" ind1="" ind2="">
<subfield code="c">2007</subfield>
</datafield>
<datafield tag="711" ind1="2" ind2="">
<subfield code="a">
Mathematical Programming Seminar</subfield>
<subfield code="c">
Center for Operations Research and Econometrics, Louvain-La-Neuve, Belgium</subfield>
<subfield code="d">April 24, 2007</subfield>
</datafield>
<datafield tag="520" ind1="" ind2="">
<subfield code="a">
The lecture will consist in two parts. First, recent advances in discrete choice models will be presented and motivated. The estimation of these advanced models involves the maximization of a nonlinear, nonconcave loglikelihood function. The nonconcavity of the function has motivated the development of an efficient heuristic to escape from local maxima. This heuristic will be presented during the second part of the lecture, together with promising numerical results.</subfield>
</datafield>
  </record>



  </collection>
