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.
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.
Please see a brief summary of the project on the webpage http://personal.lse.ac.uk/veghl/scaleopt.html
The job advertisement is available at the LSE website: https://jobs.lse.ac.uk/Vacancies/W/6186/0/255910/15539/research-officer-in-algorithms-and-optimisation
The initial appointment is for one year with the possibility of an extension. The starting date is flexible. The closing date for applications is 24th January 2020 (23.59 UK time).
If you have any questions, please do not hesitate to send an email to l.vegh@lse.ac.uk .
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Posts
