JiscMail Logo
Email discussion lists for the UK Education and Research communities

Help for UTSG Archives


UTSG Archives

UTSG Archives


UTSG@JISCMAIL.AC.UK


View:

Message:

[

First

|

Previous

|

Next

|

Last

]

By Topic:

[

First

|

Previous

|

Next

|

Last

]

By Author:

[

First

|

Previous

|

Next

|

Last

]

Font:

Proportional Font

LISTSERV Archives

LISTSERV Archives

UTSG Home

UTSG Home

UTSG  August 2018

UTSG August 2018

Options

Subscribe or Unsubscribe

Subscribe or Unsubscribe

Log In

Log In

Get Password

Get Password

Subject:

Postdoc position at SINTEF Digital, Optimization group

From:

Geir Hasle <[log in to unmask]>

Reply-To:

Geir Hasle <[log in to unmask]>

Date:

Thu, 30 Aug 2018 13:08:15 +0000

Content-Type:

text/plain

Parts/Attachments:

Parts/Attachments

text/plain (63 lines)

Dear all,

Please forward to good candidates.

Best regards,
Geir


. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
Geir HASLE, PhD
Chief Scientist

Research Manager, Group of Optimization
Mathematics and Cybernetics, SINTEF Digital
Mobile: +47-930 58 703
www.sintef.no/optimization<http://www.sintef.no/optimization>
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .

SINTEF Digital is searching for postdoctoral candidate at SINTEF Optimization

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.

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

The AXIOM project
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, and Brazil is an integral part. The main objective is to design novel methods for solving complex discrete optimization problems. Expected results are 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.

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

Expertise
We require a solid background in combinatorial optimization. We seek candidates with expertise in several of the following areas:
* Parallel computing (task and data parallelism, heterogeneous computing)
* Mathematical programming and decomposition methods
* Heuristics, metaheuristics, and matheuristics
* Cooperative search
* Vehicle routing and inventory routing

Software development skills
We are looking for candidates with excellent programming skills (C#, C++), GPU programming in particular (CUDA).

We offer
* Challenging research tasks in a project team of international experts.
* A good work environment with skillful, experienced, and creative colleagues.
* Well-established national and international scientific and industrial networks.
* Competitive salary (subject to qualifications).
* A large degree of autonomy, and flexible working hours.
* Social benefits (pension plan, insurance, possibility for kindergarten, etc.).

Duration
The duration will be two years, with the intention to make it a permanent position if all parties are interested. Start date: as soon as possible, January 1 2019 at the latest.

Applications are due October 1 2018. Click here<https://candidate.hr-manager.net/ApplicationInit.aspx?cid=1131&ProjectId=144082&DepartmentId=18961&MediaId=5> for more information and how to apply. Full hyperlink:
https://candidate.hr-manager.net/ApplicationInit.aspx?cid=1131&ProjectId=144082&DepartmentId=18961&MediaId=5




########################################################################

To unsubscribe from the UTSG list, click the following link:
https://www.jiscmail.ac.uk/cgi-bin/webadmin?SUBED1=UTSG&A=1

Top of Message | Previous Page | Permalink

JiscMail Tools


RSS Feeds and Sharing


Advanced Options


Archives

November 2018
October 2018
September 2018
August 2018
July 2018
June 2018
May 2018
April 2018
March 2018
February 2018
January 2018
December 2017
November 2017
October 2017
September 2017
August 2017
July 2017
June 2017
May 2017
April 2017
March 2017
February 2017
January 2017
December 2016
November 2016
October 2016
September 2016
August 2016
July 2016
June 2016
May 2016
April 2016
March 2016
February 2016
January 2016
December 2015
November 2015
October 2015
September 2015
August 2015
July 2015
June 2015
May 2015
April 2015
March 2015
February 2015
January 2015
December 2014
November 2014
October 2014
September 2014
August 2014
July 2014
June 2014
May 2014
April 2014
March 2014
February 2014
January 2014
December 2013
November 2013
October 2013
September 2013
August 2013
July 2013
June 2013
May 2013
April 2013
March 2013
February 2013
January 2013
December 2012
November 2012
October 2012
September 2012
August 2012
July 2012
June 2012
May 2012
April 2012
March 2012
February 2012
January 2012
December 2011
November 2011
October 2011
September 2011
August 2011
July 2011
June 2011
May 2011
April 2011
March 2011
February 2011
January 2011
December 2010
November 2010
October 2010
September 2010
August 2010
July 2010
June 2010
May 2010
April 2010
March 2010
February 2010
January 2010
December 2009
November 2009
October 2009
September 2009
August 2009
July 2009
June 2009
May 2009
April 2009
March 2009
February 2009
January 2009
December 2008
November 2008
October 2008
September 2008
August 2008
July 2008
June 2008
May 2008
April 2008
March 2008
February 2008
January 2008
December 2007
November 2007
October 2007
September 2007
August 2007
July 2007
June 2007
May 2007
April 2007
March 2007
February 2007
January 2007
2006
2005
2004
2003
2002
2001
2000
1999
1998


JiscMail is a Jisc service.

View our service policies at https://www.jiscmail.ac.uk/policyandsecurity/ and Jisc's privacy policy at https://www.jisc.ac.uk/website/privacy-notice

Secured by F-Secure Anti-Virus CataList Email List Search Powered by the LISTSERV Email List Manager