Cookies?
Library Header Image
LSE Research Online LSE Library Services

Items where Author is "Zenklusen, Rico"

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Group by: Item Type | No Grouping
Number of items: 5.

Linhares, André, Olver, Neil ORCID: 0000-0001-8897-5459, Swamy, Chaitanya and Zenklusen, Rico (2020) Approximate multi-matroid intersection via iterative refinement. Mathematical Programming: A Publication of the Mathematical Optimization Society, 183 (1-2). 397 - 418. ISSN 0025-5610

Linhares, Andre, Olver, Neil ORCID: 0000-0001-8897-5459, Swamy, Chaitanya and Zenklusen, Rico (2019) Approximate multi-matroid intersection via iterative refinement. In: Lodi, Andrea and Nagarajan, Viswanath, (eds.) Integer Programming and Combinatorial Optimization: 20th International Conference, IPCO 2019, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics),11480. Springer Berlin / Heidelberg, Cham, CHE, 299 - 312. ISBN 9783030179526

Olver, Neil ORCID: 0000-0001-8897-5459 and Zenklusen, Rico (2017) Chain-constrained spanning trees. Mathematical Programming, 167 (2). 293 - 314. ISSN 0025-5610

Olver, Neil ORCID: 0000-0001-8897-5459 and Zenklusen, Rico (2014) Chain-constrained spanning trees. In: The 16th Conference on Integer Programming and Combinatorial Optimization, 2013-03-18 - 2013-03-20, Universidad Técnica Federico Santa María, Valparaiso, Chile, CHL.

Goemans, Michel, Olver, Neil ORCID: 0000-0001-8897-5459, Rothvoß, Thomas and Zenklusen, Rico (2012) Matroids and integrality gaps for hypergraphic steiner tree relaxations. In: STOC 2012 - 44th ACM Symposium on Theory of Computing, 2012-05-19 - 2012-05-22, New York, United States, USA.

This list was generated on Thu Nov 21 04:41:13 2024 GMT.