Cardiff University | Prifysgol Caerdydd ORCA
Online Research @ Cardiff 
WelshClear Cookie - decide language by browser settings

Browse by Current Cardiff authors

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Number of items: 14.

Aliev, Iskander, Averkov, Gennadiy, De Lora, Jesus A. and Oertel, Timm 2020. Optimizing sparsity over lattices and semigroups. Lecture Notes in Computer Science
file

Oertel, Timm, Paat, Joseph and Weismantel, Robert 2019. Sparsity of integer solutions in the average case. Presented at: 20th Conference on Integer Programming and Combinatorial Optimization (IPCO XX), Ann Arbor, MI, USA, 22-24 May 2019. Published in: Lodi, Andrea and Nagarajan, Viswanath eds. Integer Programming and Combinatorial Optimization: 20th International Conference, IPCO 2019, Ann Arbor, MI, USA, May 22-24, 2019, Proceedings. Lecture Notes in Computer Science Springer Verlag, pp. 341-353. 10.1007/978-3-030-17953-3_26
Item availability restricted.
file

Aliev, Iskander, Henk, Martin and Oertel, Timm 2019. Distances to lattice points in knapsack polyhedra. Mathematical Programming 10.1007/s10107-019-01392-1
file

Aliev, I., De Loera, J., Eisenbrand, F., Oertel, T. and Weismantel, R. 2018. The support of integer optimal solutions. SIAM Journal on Optimization 28 (3) , pp. 2152-2157. 10.1137/17M1162792
file

Basu, Amitabh and Oertel, Timm 2017. Centerpoints: A link between optimization and convex geometry. SIAM Journal on Optimization 27 (2) , pp. 866-889. 10.1137/16M1092908
file

Aliev, Iskander, Henk, Martin and Oertel, Timm 2017. Integrality gaps of integer knapsack problems. Lecture Notes in Computer Science 10328 , pp. 25-38. 10.1007/978-3-319-59250-3_3
file

Aliev, Iskander, Loera, Jesus De, Oertel, Timm and O'Neill, Christopher 2017. Sparse solutions of linear diophantine equations. SIAM Journal on Applied Algebra and Geometry 1 (1) , pp. 239-253. 10.1137/16M1083876
file

Artmann, S., Eisenbrand, F., Glanzer, C., Oertel, T., Vempala, S. and Weismantel, R. 2016. A note on non-degenerate integer programs with small sub-determinants. Operations Research Letters 44 (5) , pp. 635-639. 10.1016/j.orl.2016.07.004

Baes, Michel, Oertel, Timm and Weismantel, Robert 2016. Duality for mixed-integer convex minimization. Mathematical Programming 158 , pp. 547-564. 10.1007/s10107-015-0917-y
file

Amitabh, Basu and Oertel, Timm 2016. Centerpoints: a link between optimization and convex geometry. Presented at: IPCO 2016: International Conference on Integer Programming and Combinatorial Optimization, Liege, Belgium, 1-3 June 2016. Published in: Louveaux, Quentin and Skutella, Martin eds. Integer Programming and Combinatorial Optimization: 18th International Conference, IPCO 2016, Liège, Belgium, June 1-3, 2016, Proceedings. Lecture Notes in Computer Science Springer, pp. 14-25. 10.1007/978-3-319-33461-5 2
file

Adjiashvili, David, Oertel, Timm and Weismantel, Robert 2015. A polyhedral Frobenius theorem with applications to integer optimization. SIAM Journal on Discrete Mathematics 29 (3) , pp. 1287-1302. 10.1137/14M0973694
file

Hildebrand, Robert, Oertel, Timm and Weismantel, Robert 2015. Note on the complexity of the mixed-integer hull of a polyhedron. Operations Research Letters 43 (3) , pp. 279-282. 10.1016/j.orl.2015.03.002
file

Oertel, Timm, Wagner, Christian and Weismantel, Robert 2014. Integer convex minimization by mixed integer linear optimization. Operations Research Letters 42 (6-7) , pp. 424-428. 10.1016/j.orl.2014.07.005
file

Baes, Michel, Oertel, Timm, Wagner, Christian and Weismantel, Robert 2013. Mirror-descent methods in mixed-integer convex optimization. In: Junger, Michael and Reinelt, Gerhard eds. Facets of Combinatorial Optimization: Festschrift for Martin Grötschel, Springer, pp. 101-131. (10.1007/978-3-642-38189-8_5)
file

This list was generated on Tue Mar 31 04:00:48 2020 BST.