Browser does not support script.

- Information for
- Prospective students
- Current students
- Alumni and friends
- Staff
- Businesses

- Information about
- Departments
- Institutes
- Divisions
- Research centres
- Supporting LSE
- Term dates
- LSE Vacations

- Useful links
- LSE Merchandise Shop
- Library
- Careers
- Accommodation
- Media relations
- LSE Blogs

- Linear programming from Fibonacci to Farkas

Biggs, Norman (2020) Linear programming from Fibonacci to Farkas. Annals of Science. ISSN 0003-3790 - Revisiting Tardos's framework for linear programming: faster exact solutions using approximate solvers

Dadush, Daniel, Natura, Bento and Végh, László A. (2020) Revisiting Tardos's framework for linear programming: faster exact solutions using approximate solvers. In: Proceedings of The 61st Annual Symposium on Foundations of Computer Science (FOCS 2020), November 16-19. IEEE Computer Society. (In Press) - A constant-factor approximation algorithm for the asymmetric traveling salesman problem

Svensson, Ola, Tarnawski, Jakub and Végh, László A. (2020) A constant-factor approximation algorithm for the asymmetric traveling salesman problem. Journal of the ACM. ISSN 0004-5411 (In Press) - Crux’s crux’s crux

Sasane, Amol (2020) Crux’s crux’s crux. Mathematics Magazine, 88 (1). ISSN 0025-570X - An O(log log m) prophet inequality for subadditive combinatorial auctions

Dütting, Paul, Kesselheim, Thomas and Lucier, Brendan (2020) An O(log log m) prophet inequality for subadditive combinatorial auctions. In: Proceedings of the 61st Annual IEEE Symposium on Foundations of Computer Science. IEEE Computer Society. (In Press) - Successive shortest paths in complete graphs with random edge weights

Gerke, Stefanie, Mezei, Balazs F. and Sorkin, Gregory (2020) Successive shortest paths in complete graphs with random edge weights. Random Structures and Algorithms. ISSN 1042-9832 (In Press) - Emergent hypercongestion in Vickrey bottleneck networks

Frascaria, Dario, Olver, Neil and Verhoef, Erik (2020) Emergent hypercongestion in Vickrey bottleneck networks. Transportation Research Part B: Methodological, 139. 523 - 538. ISSN 0191-2615 - Optimal stopping problems for running minima with positive discounting rates

Gapeev, Pavel V. (2020) Optimal stopping problems for running minima with positive discounting rates. Statistics and Probability Letters, 167. ISSN 0167-7152 - A functional equation of tail-balance for continuous signals in the Condorcet jury theorem

Alpern, Steve, Chen, Bo and Ostaszewski, Adam (2020) A functional equation of tail-balance for continuous signals in the Condorcet jury theorem. Aequationes Mathematicae. ISSN 0001-9054 - Discounted optimal stopping problems for maxima of geometric Brownian motions with switching payoffsHi

Gapeev, Pavel V., Kort, Peter M. and Lavrutich, Maria (2020) Discounted optimal stopping problems for maxima of geometric Brownian motions with switching payoffsHi. Advances in Applied Probability. ISSN 0001-8678 (In Press) - Large-width machine learning algorithm

Anthony, Martin and Ratsaby, Joel (2020) Large-width machine learning algorithm. Progress in Artificial Intelligence, 9 (3). 275 – 285. ISSN 2192-6360 - On the existence of spatially tempered null solutions to linear constant coefficient PDES

Sasane, Amol (2020) On the existence of spatially tempered null solutions to linear constant coefficient PDES. Israel Journal of Mathematics. ISSN 0021-2172 (In Press) - The Steinhaus-Weil property: II. The Simmons-Mospan Converse

Bingham, N. H. and Ostaszewski, Adam (2020) The Steinhaus-Weil property: II. The Simmons-Mospan Converse. Sarajevo Journal of Mathematics. ISSN 1840-0655 (In Press) - Upper density of monochromatic infinite paths

Corsten, Jan, DeBiasio, Louis, Lamaison, Ander and Lang, Richard (2020) Upper density of monochromatic infinite paths. Advances in Combinatronics, 2019 (4). ISSN 2517-5599 - On the odd cycle game and connected rules

Corsten, Jan, Mond, Adva, Pokrovskiy, Alexey, Spiegel, Christoph and Szabó, Tibor (2020) On the odd cycle game and connected rules. European Journal of Combinatorics, 89. ISSN 0195-6698 - A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix

Dadush, Daniel, Huiberts, Sophie, Natura, Bento and Végh, László A. (2020) A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix. In: Makarychev, Konstantin, Makarychev, Yury, Tulsiani, Madhur, Kamath, Gautam and Chuzhoy, Julia, (eds.) STOC 2020 - Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing. Proceedings of the Annual ACM Symposium on Theory of Computing. Association for Computing Machinery, USA, pp. 761-774. ISBN 9781450369794 - Approximate multi-matroid intersection via iterative refinement

Linhares, André, Olver, Neil, Swamy, Chaitanya and Zenklusen, Rico (2020) Approximate multi-matroid intersection via iterative refinement. Mathematical Programming, 183 (1-2). 397 - 418. ISSN 0025-5610 - Monomial tropical cones for multicriteria optimization

Joswig, Michael and Loho, Georg (2019) Monomial tropical cones for multicriteria optimization. In: Emmerich, Michael T. M., Deutz, Andre H., Hille, Sander C. and Sergeyev, Yaroslav D., (eds.) Proceedings LeGO - 14th International Global Optimization Workshop. AIP Conference Proceedings. American Institute of Physics Inc., NLD. ISBN 9780735417984 - Abstract tropical linear programming

Loho, Georg (2020) Abstract tropical linear programming. Electronic Journal of Combinatorics, 27 (2). ISSN 1077-8926 - Matching fields and lattice points of simplices

Loho, Georg and Smith, Ben (2020) Matching fields and lattice points of simplices. Advances in Mathematics, 370. ISSN 0001-8708

Browser does not support script.

Browser does not support script.

Browser does not support script.

Browser does not support script.

Browser does not support script.

Browser does not support script.