Neil Olver
Associate Professor at The London School of Economics and Political Science
Schools
- The London School of Economics and Political Science
Links
Biography
The London School of Economics and Political Science
Education
- Doctor of Philosophy - PhD McGill University (2006 — 2010)
- Master of Science - MS McGill University (2004 — 2006)
- BSc (Hons) University of Cape Town (2000 — 2004)
Companies
- Associate Professor The London School of Economics and Political Science (LSE) (2021)
- Researcher Centrum Wiskunde & Informatica (2013)
- Assistant Professor The London School of Economics and Political Science (LSE) (2019 — 2021)
- Associate Professor Vrije Universiteit Amsterdam (VU Amsterdam) (2018 — 2019)
- Assistant Professor Vrije Universiteit Amsterdam (2013 — 2018)
- Instructor Massachusetts Institute of Technology (2010 — 2013)
Publications
- Frascaria, D, & Olver, N.K. (2021). Algorithms for flows over time with scheduling costs. Mathematical Programming.
- Borst, S.J, Dadush, D.N, Olver, N.K, & Sinha, M. (2021). Majorizing measures for the optimizer. In Leibniz International Proceedings in Informatics, LIPIcs.
- Frascaria, D, Olver, N.K, & Verhoef, E. (2020). Emergent hypercongestion in Vickrey bottleneck networks. Transportation Research Part B: Methodological, 139, 523–538.
- Linhares, A, Olver, N.K, Swamy, C, & Zenklusen, R. (2020). Approximate multi-matroid intersection via iterative refinement. Mathematical Programming, 183(1-2), 397–418.
- Frascaria, D, & Olver, N.K. (2020). Algorithms for Flows over Time with Scheduling Costs. In Lecture Notes in Computer Science/Lecture Notes in Artificial Intelligence.
- Linhares, A, Olver, N.K, Swamy, C, & Zenklusen, R. (2019). Approximate Multi-matroid Intersection via Iterative Refinement. In Lecture Notes in Computer Science/Lecture Notes in Artificial Intelligence. 3
- Bosman, T, Frascaria, D. (Dario), Olver, N.K, Sitters, R.A, & Stougie, L. (2019). Fixed-Order Scheduling on Parallel Machines. In Lecture Notes in Computer Science/Lecture Notes in Artificial Intelligence.
- Olver, N.K, Pruhs, K, Schewior, K, Sitters, R.A, & Stougie, L. (2018). The itinerant list update problem. In Proceedings of the 16th Workshop on Approximation and Online Algorithms (WAOA 2018) (pp. 310–326). 9
- Dadush, D.N, Guzman, C, & Olver, N.K. (2018). Fast, deterministic and sparse dimensionality reduction. In Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 1330–1344).
- Dadush, D.N, Guzman Paredes, C.A, & Olver, N.K. (2018). Fast, deterministic and sparse dimensionality reduction. In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 1330–1344).
Videos
Neil Olver: On the integrality gap of the prize collecting Steiner forest LP
Neil Olver - Improved Approximation Algorithms for Inventory Problems
Read about executive education
Other experts
Looking for an expert?
Contact us and we'll find the best option for you.