<html>
<head>
<meta http-equiv="content-type" content="text/html; charset=windows-1252">
</head>
<body>
<p>-------- Forwarded Message --------</p>
<div class="moz-forward-container">
<table class="moz-email-headers-table" cellspacing="0"
cellpadding="0" border="0">
<tbody>
<tr>
<th valign="BASELINE" nowrap="nowrap" align="RIGHT">Subject:
</th>
<td>[DMANET] Last Call: Postdoc position in Algorithms and
Optimization at the London School of Economics</td>
</tr>
<tr>
<th valign="BASELINE" nowrap="nowrap" align="RIGHT">Date: </th>
<td>Fri, 28 May 2021 20:44:37 +0000</td>
</tr>
<tr>
<th valign="BASELINE" nowrap="nowrap" align="RIGHT">From: </th>
<td>Vegh,L <a class="moz-txt-link-rfc2396E" href="mailto:L.Vegh@lse.ac.uk"><L.Vegh@lse.ac.uk></a></td>
</tr>
<tr>
<th valign="BASELINE" nowrap="nowrap" align="RIGHT">To: </th>
<td><a class="moz-txt-link-abbreviated" href="mailto:dmanet@zpr.uni-koeln.de">dmanet@zpr.uni-koeln.de</a> <a class="moz-txt-link-rfc2396E" href="mailto:dmanet@zpr.uni-koeln.de"><dmanet@zpr.uni-koeln.de></a></td>
</tr>
</tbody>
</table>
<br>
<br>
Applications are invited for a postdoctoral research fellowship in
the Mathematics Department at the London School of Economics and
Political Science. The position is funded by the European Research
Council (ERC) Starting Grant 'Scaling Methods for Discrete and
Continuous Optimization' held by Laszlo Vegh.<br>
<br>
The project focuses on problems and methods on the interface
between discrete and continuous optimization. A key goal is to
further our understanding of strongly polynomial computability,
including making progress towards the important open question of
finding a strongly polynomial algorithm for linear programming.<br>
<br>
Areas of particular interest include: efficient algorithms for
linear and convex programming, and the geometry of linear and
convex programs; strongly polynomial computability; mean payoff
games and tropical linear programming; polynomial-time exact and
approximation algorithms for network optimization problems; market
equilibrium computation and fair division problems.<br>
<br>
Please see a brief summary of the project on the webpage
<a class="moz-txt-link-freetext" href="http://personal.lse.ac.uk/veghl/scaleopt.html">http://personal.lse.ac.uk/veghl/scaleopt.html</a><br>
The job advertisement is available at the LSE website:
<a class="moz-txt-link-freetext" href="https://jobs.lse.ac.uk/Vacancies/W/4533/0/296507/15539/research-officer-in-algorithms-and-optimisation">https://jobs.lse.ac.uk/Vacancies/W/4533/0/296507/15539/research-officer-in-algorithms-and-optimisation</a><br>
<br>
The initial appointment is for one year with the possibility of an
extension. The starting date is flexible. The closing date for
applications is 5th June 2021 (23.59 UK time).<br>
<br>
If you have any questions, please do not hesitate to send an email
to <a class="moz-txt-link-abbreviated" href="mailto:l.vegh@lse.ac.uk">l.vegh@lse.ac.uk</a><a class="moz-txt-link-rfc2396E" href="mailto:l.vegh@lse.ac.uk"><mailto:l.vegh@lse.ac.uk></a><br>
<br>
</div>
</body>
</html>