<html>
  <head>

    <meta http-equiv="content-type" content="text/html; charset=UTF-8">
  </head>
  <body bgcolor="#FFFFFF" text="#000000">
    <br>
    <div class="moz-forward-container"><br>
      <br>
      -------- Mensaje reenviado --------
      <table class="moz-email-headers-table" border="0" cellpadding="0"
        cellspacing="0">
        <tbody>
          <tr>
            <th align="RIGHT" nowrap="nowrap" valign="BASELINE">Asunto:
            </th>
            <td>FW: Postdoctoral position at SINTEF Optimization</td>
          </tr>
          <tr>
            <th align="RIGHT" nowrap="nowrap" valign="BASELINE">Fecha: </th>
            <td>Mon, 19 Feb 2018 13:41:49 +0000</td>
          </tr>
          <tr>
            <th align="RIGHT" nowrap="nowrap" valign="BASELINE">De: </th>
            <td>Geir Hasle <a class="moz-txt-link-rfc2396E" href="mailto:Geir.Hasle@SINTEF.NO">&lt;Geir.Hasle@SINTEF.NO&gt;</a></td>
          </tr>
          <tr>
            <th align="RIGHT" nowrap="nowrap" valign="BASELINE">Responder
              a: </th>
            <td>Geir Hasle <a class="moz-txt-link-rfc2396E" href="mailto:Geir.Hasle@SINTEF.NO">&lt;Geir.Hasle@SINTEF.NO&gt;</a></td>
          </tr>
          <tr>
            <th align="RIGHT" nowrap="nowrap" valign="BASELINE">Para: </th>
            <td><a class="moz-txt-link-abbreviated" href="mailto:MODERN-HEURISTICS@JISCMAIL.AC.UK">MODERN-HEURISTICS@JISCMAIL.AC.UK</a></td>
          </tr>
        </tbody>
      </table>
      <br>
      <br>
      <meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
      <meta name="Generator" content="Microsoft Word 15 (filtered
        medium)">
      <style><!--
/* Font Definitions */
@font-face
        {font-family:"Cambria Math";
        panose-1:2 4 5 3 5 4 6 3 2 4;}
@font-face
        {font-family:Calibri;
        panose-1:2 15 5 2 2 2 4 3 2 4;}
@font-face
        {font-family:"MS PGothic";
        panose-1:2 11 6 0 7 2 5 8 2 4;}
@font-face
        {font-family:"\@MS PGothic";
        panose-1:2 11 6 0 7 2 5 8 2 4;}
/* Style Definitions */
p.MsoNormal, li.MsoNormal, div.MsoNormal
        {margin:0cm;
        margin-bottom:.0001pt;
        font-size:11.0pt;
        font-family:"Calibri",sans-serif;
        mso-fareast-language:EN-US;}
a:link, span.MsoHyperlink
        {mso-style-priority:99;
        color:#0563C1;
        text-decoration:underline;}
a:visited, span.MsoHyperlinkFollowed
        {mso-style-priority:99;
        color:#954F72;
        text-decoration:underline;}
p.msonormal0, li.msonormal0, div.msonormal0
        {mso-style-name:msonormal;
        mso-margin-top-alt:auto;
        margin-right:0cm;
        mso-margin-bottom-alt:auto;
        margin-left:0cm;
        font-size:12.0pt;
        font-family:"MS PGothic",sans-serif;
        mso-fareast-language:JA;}
span.EmailStyle18
        {mso-style-type:personal;
        font-family:"Calibri",sans-serif;
        color:windowtext;}
span.EmailStyle19
        {mso-style-type:personal;
        font-family:"Calibri",sans-serif;
        color:windowtext;}
span.EmailStyle20
        {mso-style-type:personal;
        font-family:"Calibri",sans-serif;
        color:windowtext;}
span.EmailStyle21
        {mso-style-type:personal;
        font-family:"Calibri",sans-serif;
        color:windowtext;}
span.EmailStyle22
        {mso-style-type:personal-reply;
        font-family:"Calibri",sans-serif;
        color:windowtext;}
.MsoChpDefault
        {mso-style-type:export-only;
        font-size:10.0pt;}
@page WordSection1
        {size:612.0pt 792.0pt;
        margin:70.85pt 70.85pt 70.85pt 70.85pt;}
div.WordSection1
        {page:WordSection1;}
--></style><!--[if gte mso 9]><xml>
<o:shapedefaults v:ext="edit" spidmax="1026" />
</xml><![endif]--><!--[if gte mso 9]><xml>
<o:shapelayout v:ext="edit">
<o:idmap v:ext="edit" data="1" />
</o:shapelayout></xml><![endif]-->
      <div class="WordSection1">
        <p class="MsoNormal"><span style="mso-fareast-language:NO-BOK"
            lang="EN-US">Dear all,<o:p></o:p></span></p>
        <p class="MsoNormal"><span style="mso-fareast-language:NO-BOK"
            lang="EN-US"><o:p> </o:p></span></p>
        <p class="MsoNormal"><span style="mso-fareast-language:NO-BOK"
            lang="EN-US">SINTEF Digital is searching for<o:p></o:p></span></p>
        <p class="MsoNormal"><b><span
              style="color:#00ACF2;mso-fareast-language:NO-BOK"
              lang="EN-US">Postdoctoral candidate at SINTEF Optimization</span></b><span
            style="mso-fareast-language:NO-BOK" lang="EN-US"><o:p></o:p></span></p>
        <p class="MsoNormal"><span style="mso-fareast-language:NO-BOK"
            lang="EN-US"><o:p> </o:p></span></p>
        <p class="MsoNormal"><span style="mso-fareast-language:NO-BOK"
            lang="EN-US">The Optimization group at SINTEF Digital is
            looking for a professional and dedicated postdoctoral
            candidate. The candidate will be working within the basic
            research project “Design and Experimental Analysis of Novel
            Integrated Optimization Methods” (AXIOM) funded by the
            Research Council of Norway. Keywords are discrete
            optimization, matheuristics, cooperative methods, parallel
            and heterogeneous computing, GPU, vehicle routing, inventory
            routing. The duration of the position will be two years,
            with the intention to make it a permanent position if all
            parties are interested.  <o:p></o:p></span></p>
        <p class="MsoNormal"><span style="mso-fareast-language:NO-BOK"
            lang="EN-US"> <o:p></o:p></span></p>
        <p class="MsoNormal"><b><span
              style="mso-fareast-language:NO-BOK" lang="EN-US">About us:</span></b><span
            style="mso-fareast-language:NO-BOK" lang="EN-US">  <o:p></o:p></span></p>
        <p class="MsoNormal"><span style="mso-fareast-language:NO-BOK"
            lang="EN-US">The Optimization group currently consists of 17
            researchers and software engineers. It is one of eight
            groups within the Department of Mathematics and Cybernetics.
            For the past 20 years, we have been developing optimization
            methods, software prototypes, libraries, and components. We
            have built expertise at an international level and have a
            good publication record. The group conducts basic and
            applied research on discrete optimization for planning,
            scheduling, routing, sequencing, and timetabling. Our main
            market areas are transportation: road, railway, maritime,
            aviation; healthcare; sports; energy; and finance. We
            develop our own software libraries that have been refined
            over many years and contain a range of different solution
            methods (exact and approximate), but we also utilize
            commercial solvers. We commercialize our results, either
            through existing solution vendors, spin-off companies, or
            directly to end users. Our revenues come from users in
            industry and the public sector, often supported by Norwegian
            or EU funding bodies.  <o:p></o:p></span></p>
        <p class="MsoNormal"><b><span
              style="mso-fareast-language:NO-BOK" lang="EN-US"> </span></b><span
            style="mso-fareast-language:NO-BOK" lang="EN-US"><o:p></o:p></span></p>
        <p class="MsoNormal"><b><span
              style="mso-fareast-language:NO-BOK" lang="EN-US">The AXIOM
              project:</span></b><span
            style="mso-fareast-language:NO-BOK" lang="EN-US"> SINTEF has
            two partners: 1) Department of Industrial Economics and
            Technology Management at NTNU (project owner) 2) Molde
            University College. Collaboration with world leading
            research groups from Portugal, Canada, USA, Italy, Brazil is
            an integral part. The main objective is to design novel
            integrated methods for solving complex discrete optimization
            problems. Expected results are innovative methods that
            combine elements from exact methods and metaheuristics and
            utilize cooperative search, task parallelism, and data
            parallelism. AXIOM has four work packages (WPs). WP1 starts
            from exact methods and analyzes how these methods can be
            extended and improved using heuristics. WP2 investigates how
            exact methods are best utilized within a metaheuristic
            framework. WP3 develops cooperative search methods that
            fully utilize all processing units of modern PCs and are
            flexible and scalable. In WP4 experimental data are
            collected, analyzed, and synthesized into new knowledge and
            understanding. The candidate will mainly work within WP3.  <o:p></o:p></span></p>
        <p class="MsoNormal"><b><span
              style="mso-fareast-language:NO-BOK" lang="EN-US"> </span></b><span
            style="mso-fareast-language:NO-BOK" lang="EN-US"><o:p></o:p></span></p>
        <p class="MsoNormal"><b><span
              style="mso-fareast-language:NO-BOK" lang="EN-US">Qualifications:</span></b><span
            style="mso-fareast-language:NO-BOK" lang="EN-US"> As a
            postdoc in AXIOM, your responsibilities will involve
            development of cooperative search methods for vehicle
            routing problems. We are looking for candidates with a PhD
            in applied mathematics, operations research, or computer
            science. Fluency in English is expected, along with
            excellent communication and presentation skills. Moreover,
            you should be curious, inventive, have a proactive attitude,
            and be a good team player.  <o:p></o:p></span></p>
        <p class="MsoNormal"><span style="mso-fareast-language:NO-BOK"
            lang="EN-US"> <o:p></o:p></span></p>
        <p class="MsoNormal"><b><span
              style="mso-fareast-language:NO-BOK" lang="EN-US">Expertise:</span></b><span
            style="mso-fareast-language:NO-BOK" lang="EN-US"> We require
            a solid background in combinatorial optimization. We seek
            candidates with expertise in several of the following areas:
             <o:p></o:p></span></p>
        <p class="MsoNormal"><span style="mso-fareast-language:NO-BOK"
            lang="EN-US">● Parallel computing (task and data
            parallelism, heterogeneous computing)  <o:p></o:p></span></p>
        <p class="MsoNormal"><span style="mso-fareast-language:NO-BOK"
            lang="EN-US">● Mathematical programming and decomposition
            methods  <o:p></o:p></span></p>
        <p class="MsoNormal"><span style="mso-fareast-language:NO-BOK"
            lang="EN-US">● Heuristics, metaheuristics, and matheuristics
             <o:p></o:p></span></p>
        <p class="MsoNormal"><span style="mso-fareast-language:NO-BOK"
            lang="EN-US">● Cooperative search  <o:p></o:p></span></p>
        <p class="MsoNormal"><span style="mso-fareast-language:NO-BOK"
            lang="EN-US">● Vehicle routing and inventory routing  <o:p></o:p></span></p>
        <p class="MsoNormal"><span style="mso-fareast-language:NO-BOK"
            lang="EN-US"> <o:p></o:p></span></p>
        <p class="MsoNormal"><b><span
              style="mso-fareast-language:NO-BOK" lang="EN-US">Software
              development skills:</span></b><span
            style="mso-fareast-language:NO-BOK" lang="EN-US"><o:p></o:p></span></p>
        <p class="MsoNormal"><span style="mso-fareast-language:NO-BOK"
            lang="EN-US">● We are looking for candidates with excellent
            programming skills (C#, C++),
            <br>
                GPU programming in particular (CUDA).  <o:p></o:p></span></p>
        <p class="MsoNormal"><b><span
              style="mso-fareast-language:NO-BOK" lang="EN-US"> </span></b><span
            style="mso-fareast-language:NO-BOK" lang="EN-US"><o:p></o:p></span></p>
        <p class="MsoNormal"><b><span
              style="mso-fareast-language:NO-BOK" lang="EN-US">We offer:
            </span></b><span style="mso-fareast-language:NO-BOK"
            lang="EN-US"> <o:p></o:p></span></p>
        <p class="MsoNormal"><span style="mso-fareast-language:NO-BOK"
            lang="EN-US">● Challenging research tasks in a project team
            of international experts.  <o:p></o:p></span></p>
        <p class="MsoNormal"><span style="mso-fareast-language:NO-BOK"
            lang="EN-US">● A good work environment with skillful,
            experienced, and creative research
            <br>
                colleagues.  <o:p></o:p></span></p>
        <p class="MsoNormal"><span style="mso-fareast-language:NO-BOK"
            lang="EN-US">● Well-established national and international
            scientific and industrial networks.  <o:p></o:p></span></p>
        <p class="MsoNormal"><span style="mso-fareast-language:NO-BOK"
            lang="EN-US">● Competitive salary (subject to
            qualifications).  <o:p></o:p></span></p>
        <p class="MsoNormal"><span style="mso-fareast-language:NO-BOK"
            lang="EN-US">● A large degree of autonomy, and flexible
            working hours.  <o:p></o:p></span></p>
        <p class="MsoNormal"><span style="mso-fareast-language:NO-BOK"
            lang="EN-US">● Social benefits (pension plan, insurance,
            possibility for kindergarten, etc.).  <o:p></o:p></span></p>
        <p class="MsoNormal"><span style="mso-fareast-language:NO-BOK"
            lang="EN-US"> <o:p></o:p></span></p>
        <p class="MsoNormal"><b><span
              style="mso-fareast-language:NO-BOK" lang="EN-US">Duration:</span></b><span
            style="mso-fareast-language:NO-BOK" lang="EN-US"> The
            duration will be two years, with the intention to make it a
            permanent position if all parties are interested. Start
            date: July 1 2018.  <o:p></o:p></span></p>
        <p class="MsoNormal"><span style="font-size:12.0pt" lang="EN-US"><o:p> </o:p></span></p>
        <p class="MsoNormal"><span style="font-size:12.0pt" lang="EN-US">To
            apply, click <a moz-do-not-send="true"
href="https://www.sintef.no/en/sintef-is-looking-for-the-next-generation-of-probl/vacant-positions/">here</a>.<o:p></o:p></span></p>
        <p class="MsoNormal"><span style="font-size:12.0pt" lang="EN-US"><o:p> </o:p></span></p>
        <p class="MsoNormal"><span style="font-size:12.0pt" lang="EN-US">Sincerely,<o:p></o:p></span></p>
        <p class="MsoNormalCxSpMiddle"
          style="margin-top:1.0pt;mso-add-space:auto"><span
            style="mso-fareast-language:NO-BOK" lang="EN-US">. . . . . .
            . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
            <br>
            Geir HASLE, PhD<br>
            Chief Scientist<o:p></o:p></span></p>
        <p class="MsoNormalCxSpMiddle"
          style="margin-top:1.0pt;mso-add-space:auto"><span
            style="mso-fareast-language:NO-BOK" lang="EN-US">Research
            Manager, Group of Optimization<br>
            Mathematics and Cybernetics, SINTEF Digital<br>
            Mobile: +47-930 58 703</span><span
            style="font-size:10.0pt;mso-fareast-language:NO-BOK"
            lang="EN-US"><br>
          </span><span style="mso-fareast-language:NO-BOK" lang="EN-US"><a
              moz-do-not-send="true"
              href="http://www.sintef.no/optimization"><span
                style="color:blue"><a class="moz-txt-link-abbreviated" href="http://www.sintef.no/optimization">www.sintef.no/optimization</a></span></a>
            <br>
            . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
            . . . . . .</span><span
            style="font-size:10.0pt;mso-fareast-language:NO-BOK"
            lang="EN-US">
          </span><span style="mso-fareast-language:NO-BOK" lang="EN-US"><o:p></o:p></span></p>
        <p class="MsoNormal"><span lang="EN-US"><o:p> </o:p></span></p>
      </div>
      <br>
    </div>
    <br>
  </body>
</html>